[{"acceptance":0.5335187057633973,"acs":21106,"articleLive":2,"columnArticles":252,"formTitle":"[1646]获取生成数组中的最大值","frequency":0.0,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":39560,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5186241270720174,"acs":2390294,"articleLive":2,"columnArticles":13752,"formTitle":"[1]两数之和","frequency":4.8321305314,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":4608914,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.40725292100760113,"acs":955564,"articleLive":2,"columnArticles":6842,"formTitle":"[2]两数相加","frequency":4.79648884,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2346365,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.37830080998852117,"acs":1169293,"articleLive":2,"columnArticles":7037,"formTitle":"[3]无重复字符的最长子串","frequency":4.7252054574,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3090908,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.40674741886784804,"acs":481737,"articleLive":2,"columnArticles":3592,"formTitle":"[4]寻找两个正序数组的中位数","frequency":4.5890901694,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1184364,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.3518015149160417,"acs":692681,"articleLive":2,"columnArticles":3779,"formTitle":"[5]最长回文子串","frequency":4.5874242499,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":1968954,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5059185067152288,"acs":288925,"articleLive":2,"columnArticles":2330,"formTitle":"[6]Z 字形变换","frequency":3.734548363,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":571090,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.3538672573276963,"acs":798166,"articleLive":2,"columnArticles":5056,"formTitle":"[7]整数反转","frequency":4.7608471487,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":2255552,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21673930156449606,"acs":330672,"articleLive":2,"columnArticles":2583,"formTitle":"[8]字符串转换整数 (atoi)","frequency":3.6253832864,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1525667,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5856186353933023,"acs":735749,"articleLive":2,"columnArticles":4723,"formTitle":"[9]回文数","frequency":3.7925136933,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1256362,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.31629087312204573,"acs":195055,"articleLive":2,"columnArticles":1189,"formTitle":"[10]正则表达式匹配","frequency":4.2327489122,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":616695,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.632367895654163,"acs":508678,"articleLive":2,"columnArticles":2878,"formTitle":"[11]盛最多水的容器","frequency":4.0892352077,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":804402,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6657250846656206,"acs":216822,"articleLive":2,"columnArticles":1704,"formTitle":"[12]整数转罗马数字","frequency":3.6685376011,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":325693,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6331515688707676,"acs":446451,"articleLive":2,"columnArticles":3731,"formTitle":"[13]罗马数字转整数","frequency":3.9125315182,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":705125,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4060573930293806,"acs":593595,"articleLive":2,"columnArticles":3710,"formTitle":"[14]最长公共前缀","frequency":4.2674444998,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1461850,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.33204870872798925,"acs":614405,"articleLive":2,"columnArticles":2898,"formTitle":"[15]三数之和","frequency":4.5282223926,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":1850346,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.45984619099808666,"acs":247549,"articleLive":2,"columnArticles":1357,"formTitle":"[16]最接近的三数之和","frequency":4.1396376714,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":538330,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5713751921907962,"acs":319593,"articleLive":2,"columnArticles":2896,"formTitle":"[17]电话号码的字母组合","frequency":3.8027707195,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":559340,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.40235496400006143,"acs":209672,"articleLive":2,"columnArticles":1442,"formTitle":"[18]四数之和","frequency":3.3283296044,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","submitted":521112,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.4272151474500881,"acs":478020,"articleLive":2,"columnArticles":3595,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":3.6802844765,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1118921,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.44451546834381955,"acs":739219,"articleLive":2,"columnArticles":5295,"formTitle":"[20]有效的括号","frequency":4.4414787756,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1662977,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6661429279874224,"acs":670291,"articleLive":2,"columnArticles":3258,"formTitle":"[21]合并两个有序链表","frequency":4.0709765299,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1006227,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7724707873886159,"acs":328555,"articleLive":2,"columnArticles":2495,"formTitle":"[22]括号生成","frequency":4.4178188807,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":425330,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5582516900390607,"acs":305132,"articleLive":2,"columnArticles":1995,"formTitle":"[23]合并K个升序链表","frequency":3.999570639,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":546585,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7021916792234068,"acs":299180,"articleLive":2,"columnArticles":2399,"formTitle":"[24]两两交换链表中的节点","frequency":2.8971382237,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":426066,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6560732337966233,"acs":213645,"articleLive":2,"columnArticles":2056,"formTitle":"[25]K 个一组翻转链表","frequency":4.365167226,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":325642,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5403875085479827,"acs":770471,"articleLive":2,"columnArticles":4312,"formTitle":"[26]删除有序数组中的重复项","frequency":3.9011755025,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1425775,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5982858180593134,"acs":454635,"articleLive":2,"columnArticles":3868,"formTitle":"[27]移除元素","frequency":3.5950020934,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":759896,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.4071822562905085,"acs":445356,"articleLive":2,"columnArticles":3104,"formTitle":"[28]实现 strStr()","frequency":3.7033721925,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1093751,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.20726391099815836,"acs":104552,"articleLive":2,"columnArticles":856,"formTitle":"[29]两数相除","frequency":3.285917488,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"","submitted":504439,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.3551336610774036,"acs":75272,"articleLive":2,"columnArticles":555,"formTitle":"[30]串联所有单词的子串","frequency":2.879087192,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":211954,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.373090740310977,"acs":200956,"articleLive":2,"columnArticles":1641,"formTitle":"[31]下一个排列","frequency":3.8853304599,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":538625,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3551522338807394,"acs":179088,"articleLive":2,"columnArticles":1243,"formTitle":"[32]最长有效括号","frequency":3.7518199495,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":504257,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.425020424785571,"acs":340228,"articleLive":2,"columnArticles":2273,"formTitle":"[33]搜索旋转排序数组","frequency":3.7233999755,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":800498,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.4247682990304268,"acs":315825,"articleLive":2,"columnArticles":3063,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":3.4877037708,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":743523,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.4668037235452713,"acs":466610,"articleLive":2,"columnArticles":3680,"formTitle":"[35]搜索插入位置","frequency":3.4980821526,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":999585,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6282796366303673,"acs":167025,"articleLive":2,"columnArticles":1088,"formTitle":"[36]有效的数独","frequency":2.5565266789,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":265845,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6707743123928095,"acs":95040,"articleLive":2,"columnArticles":809,"formTitle":"[37]解数独","frequency":3.1705958839,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":141687,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5792548231689719,"acs":208731,"articleLive":2,"columnArticles":2197,"formTitle":"[38]外观数列","frequency":3.0989466681,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"","submitted":360344,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7267232474385102,"acs":312366,"articleLive":2,"columnArticles":1841,"formTitle":"[39]组合总和","frequency":3.5000161648,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":429828,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.629121661224148,"acs":187840,"articleLive":2,"columnArticles":1311,"formTitle":"[40]组合总和 II","frequency":3.4647899801,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":298575,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.41820181764751874,"acs":155119,"articleLive":2,"columnArticles":1365,"formTitle":"[41]缺失的第一个正数","frequency":4.1575732273,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":370919,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.573370298444501,"acs":301743,"articleLive":2,"columnArticles":2323,"formTitle":"[42]接雨水","frequency":4.6320018345,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":526262,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.448741981577474,"acs":161106,"articleLive":2,"columnArticles":1079,"formTitle":"[43]字符串相乘","frequency":3.9114561645,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":359017,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.32771136127692707,"acs":80811,"articleLive":2,"columnArticles":525,"formTitle":"[44]通配符匹配","frequency":3.1302840977,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":246592,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.42384880033436206,"acs":179497,"articleLive":2,"columnArticles":1479,"formTitle":"[45]跳跃游戏 II","frequency":4.6895637661,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":423493,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7821016949152543,"acs":392224,"articleLive":2,"columnArticles":2528,"formTitle":"[46]全排列","frequency":4.5777586034,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":501500,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6358441196408999,"acs":200722,"articleLive":2,"columnArticles":1396,"formTitle":"[47]全排列 II","frequency":3.3833338447,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":315678,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7347846954115879,"acs":208213,"articleLive":2,"columnArticles":1776,"formTitle":"[48]旋转图像","frequency":3.4695197986,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":283366,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6634877873563219,"acs":221658,"articleLive":2,"columnArticles":1243,"formTitle":"[49]字母异位词分组","frequency":3.3298165272,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"","submitted":334080,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.3767422267091798,"acs":207484,"articleLive":2,"columnArticles":1233,"formTitle":"[50]Pow(x, n)","frequency":3.2353977708,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":550732,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.738975455749058,"acs":145120,"articleLive":2,"columnArticles":1467,"formTitle":"[51]N 皇后","frequency":3.1943608575,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":196380,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8237933866136177,"acs":71226,"articleLive":2,"columnArticles":584,"formTitle":"[52]N皇后 II","frequency":1.3709030133,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":86461,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5503589534450389,"acs":626172,"articleLive":2,"columnArticles":3539,"formTitle":"[53]最大子序和","frequency":3.7085944511,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1137752,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.4784262435105233,"acs":179240,"articleLive":2,"columnArticles":1904,"formTitle":"[54]螺旋矩阵","frequency":4.1855049391,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":374645,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.4316573599877389,"acs":298542,"articleLive":2,"columnArticles":2324,"formTitle":"[55]跳跃游戏","frequency":3.5607576443,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":691618,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.46553161090606027,"acs":281520,"articleLive":2,"columnArticles":2183,"formTitle":"[56]合并区间","frequency":4.2160135203,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"","submitted":604728,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.4104153566601146,"acs":82892,"articleLive":2,"columnArticles":898,"formTitle":"[57]插入区间","frequency":1.9402969912,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":201971,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.3516064537127447,"acs":211736,"articleLive":2,"columnArticles":2284,"formTitle":"[58]最后一个单词的长度","frequency":2.5790016615,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"","submitted":602196,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7935440798477819,"acs":118861,"articleLive":2,"columnArticles":1485,"formTitle":"[59]螺旋矩阵 II","frequency":3.6324456289,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":149785,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5233430120944519,"acs":87235,"articleLive":2,"columnArticles":910,"formTitle":"[60]排列序列","frequency":1.7815319859,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":166688,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4182895250257174,"acs":188672,"articleLive":2,"columnArticles":1920,"formTitle":"[61]旋转链表","frequency":3.5793809063,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":451056,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6593596981778289,"acs":295707,"articleLive":2,"columnArticles":2304,"formTitle":"[62]不同路径","frequency":3.23465592,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":448476,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.3893809755418091,"acs":170522,"articleLive":2,"columnArticles":1619,"formTitle":"[63]不同路径 II","frequency":3.3283296044,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":437931,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6875961676271035,"acs":254271,"articleLive":2,"columnArticles":1984,"formTitle":"[64]最小路径和","frequency":3.4567343531,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":369797,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.26889482638805684,"acs":44885,"articleLive":2,"columnArticles":622,"formTitle":"[65]有效数字","frequency":2.2690405504,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":166924,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.45856797293425317,"acs":332891,"articleLive":2,"columnArticles":3036,"formTitle":"[66]加一","frequency":3.045610174,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":725936,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5441053743485594,"acs":186466,"articleLive":2,"columnArticles":1715,"formTitle":"[67]二进制求和","frequency":2.8091984792,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":342702,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.47007478239548856,"acs":19172,"articleLive":2,"columnArticles":289,"formTitle":"[68]文本左右对齐","frequency":2.1398102397,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"","submitted":40785,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.392963574730886,"acs":364469,"articleLive":2,"columnArticles":1841,"formTitle":"[69]x 的平方根","frequency":3.7784229994,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":927488,"title":"x 的平方根","titleSlug":"sqrtx"},{"acceptance":0.5273097457689786,"acs":534816,"articleLive":2,"columnArticles":3373,"formTitle":"[70]爬楼梯","frequency":4.3293499071,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1014235,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.4214177132299633,"acs":90097,"articleLive":2,"columnArticles":794,"formTitle":"[71]简化路径","frequency":2.6066876452,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":213795,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6123709719086611,"acs":163560,"articleLive":2,"columnArticles":1172,"formTitle":"[72]编辑距离","frequency":4.4925807013,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":267093,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6007032369155971,"acs":124542,"articleLive":2,"columnArticles":911,"formTitle":"[73]矩阵置零","frequency":2.5847039065,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":207327,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.4576981116919034,"acs":159538,"articleLive":2,"columnArticles":1612,"formTitle":"[74]搜索二维矩阵","frequency":3.655391625,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":348566,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5937015711869644,"acs":251698,"articleLive":2,"columnArticles":1760,"formTitle":"[75]颜色分类","frequency":2.2829981605,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":423947,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.42308342028121426,"acs":170308,"articleLive":2,"columnArticles":1176,"formTitle":"[76]最小覆盖子串","frequency":4.0191433919,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":402540,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7700732703852211,"acs":202423,"articleLive":2,"columnArticles":1197,"formTitle":"[77]组合","frequency":3.4734442964,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":262862,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8003164134723519,"acs":293909,"articleLive":2,"columnArticles":1936,"formTitle":"[78]子集","frequency":3.7100299513,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":367241,"title":"子集","titleSlug":"subsets"},{"acceptance":0.4567877482755982,"acs":208937,"articleLive":2,"columnArticles":1328,"formTitle":"[79]单词搜索","frequency":3.5431262884,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":457405,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6157671310727263,"acs":143023,"articleLive":2,"columnArticles":1289,"formTitle":"[80]删除有序数组中的重复项 II","frequency":3.2207972662,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":232268,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.4162268783246425,"acs":119013,"articleLive":2,"columnArticles":955,"formTitle":"[81]搜索旋转排序数组 II","frequency":3.4626146475,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":285933,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5284369685323842,"acs":167477,"articleLive":2,"columnArticles":1609,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":3.8216242624,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":316929,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5385630400603623,"acs":298358,"articleLive":2,"columnArticles":1837,"formTitle":"[83]删除排序链表中的重复元素","frequency":3.3233278434,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":553989,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.43251112110761236,"acs":173065,"articleLive":2,"columnArticles":1097,"formTitle":"[84]柱状图中最大的矩形","frequency":3.8839591063,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":400140,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5162157620567972,"acs":92160,"articleLive":2,"columnArticles":651,"formTitle":"[85]最大矩形","frequency":2.9192532337,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":178530,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6319458977211397,"acs":114750,"articleLive":2,"columnArticles":1059,"formTitle":"[86]分隔链表","frequency":2.8091984792,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":181582,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.48946550540276823,"acs":40632,"articleLive":2,"columnArticles":303,"formTitle":"[87]扰乱字符串","frequency":3.3459742515,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":83013,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5147404690929107,"acs":432033,"articleLive":2,"columnArticles":3048,"formTitle":"[88]合并两个有序数组","frequency":4.6016603148,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":839322,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7090853935992719,"acs":56100,"articleLive":2,"columnArticles":455,"formTitle":"[89]格雷编码","frequency":2.2350262367,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":79116,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6338340021408357,"acs":129678,"articleLive":2,"columnArticles":1151,"formTitle":"[90]子集 II","frequency":3.6289942553,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":204593,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.30401533824167687,"acs":152699,"articleLive":2,"columnArticles":1454,"formTitle":"[91]解码方法","frequency":3.1930599597,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":502274,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5466178044142351,"acs":197188,"articleLive":2,"columnArticles":1933,"formTitle":"[92]反转链表 II","frequency":4.3128490664,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":360742,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5367704720253356,"acs":142373,"articleLive":2,"columnArticles":1251,"formTitle":"[93]复原 IP 地址","frequency":3.9421558585,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":265240,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.755956762061451,"acs":523810,"articleLive":2,"columnArticles":2167,"formTitle":"[94]二叉树的中序遍历","frequency":2.9971916161,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":692910,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.6985160342824577,"acs":95601,"articleLive":2,"columnArticles":593,"formTitle":"[95]不同的二叉搜索树 II","frequency":2.9000194058,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":136863,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6992476353265853,"acs":151771,"articleLive":2,"columnArticles":1214,"formTitle":"[96]不同的二叉搜索树","frequency":3.3833338447,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":217049,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4571027512633352,"acs":56987,"articleLive":2,"columnArticles":514,"formTitle":"[97]交错字符串","frequency":2.1101109672,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":124670,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.34812897706005025,"acs":325518,"articleLive":2,"columnArticles":1824,"formTitle":"[98]验证二叉搜索树","frequency":3.5000161648,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":935050,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6160615350520795,"acs":66717,"articleLive":2,"columnArticles":553,"formTitle":"[99]恢复二叉搜索树","frequency":2.6698798593,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":108296,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6039550619175285,"acs":236539,"articleLive":2,"columnArticles":1796,"formTitle":"[100]相同的树","frequency":2.678958922,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":391650,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5604119753941394,"acs":386000,"articleLive":2,"columnArticles":2140,"formTitle":"[101]对称二叉树","frequency":3.4926469346,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":688779,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6421201342548802,"acs":371340,"articleLive":2,"columnArticles":2366,"formTitle":"[102]二叉树的层序遍历","frequency":4.226824298,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":578303,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5716141841995263,"acs":164099,"articleLive":2,"columnArticles":1514,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":3.8901912093,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":287080,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7655904529735246,"acs":486153,"articleLive":2,"columnArticles":2418,"formTitle":"[104]二叉树的最大深度","frequency":3.6503263079,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":635004,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.703016143376091,"acs":233201,"articleLive":2,"columnArticles":1353,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":3.926586532,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":331715,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7211627614152768,"acs":126003,"articleLive":2,"columnArticles":833,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":3.2817494955,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":174722,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6949832242986518,"acs":157012,"articleLive":2,"columnArticles":1268,"formTitle":"[107]二叉树的层序遍历 II","frequency":3.0266160384,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":225922,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7587848126544571,"acs":182380,"articleLive":2,"columnArticles":1143,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":2.4577023522,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":240358,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7634894063139384,"acs":90304,"articleLive":2,"columnArticles":691,"formTitle":"[109]有序链表转换二叉搜索树","frequency":2.7595095142,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":118278,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5622086429183158,"acs":242891,"articleLive":2,"columnArticles":1390,"formTitle":"[110]平衡二叉树","frequency":3.0989466681,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":432030,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.483946097242515,"acs":255374,"articleLive":2,"columnArticles":1704,"formTitle":"[111]二叉树的最小深度","frequency":2.0465616718,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":527691,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5258312440054519,"acs":249997,"articleLive":2,"columnArticles":1573,"formTitle":"[112]路径总和","frequency":2.7357060793,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":475432,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6257593299852645,"acs":166467,"articleLive":2,"columnArticles":1169,"formTitle":"[113]路径总和 II","frequency":3.0508141824,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":266024,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7252613727752719,"acs":165934,"articleLive":2,"columnArticles":1233,"formTitle":"[114]二叉树展开为链表","frequency":2.2374154386,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":228792,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5256349867748832,"acs":58028,"articleLive":2,"columnArticles":653,"formTitle":"[115]不同的子序列","frequency":3.2466492448,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":110396,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7021978552796831,"acs":145369,"articleLive":2,"columnArticles":1093,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":2.454311139,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":207020,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6091823762304311,"acs":83857,"articleLive":2,"columnArticles":705,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":1.2128460785,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":137655,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7244677200902935,"acs":200587,"articleLive":2,"columnArticles":1641,"formTitle":"[118]杨辉三角","frequency":3.4060983151,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":276875,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6622124625807468,"acs":134498,"articleLive":2,"columnArticles":1150,"formTitle":"[119]杨辉三角 II","frequency":2.7000389606,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":203104,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6786845908873134,"acs":168571,"articleLive":2,"columnArticles":1490,"formTitle":"[120]三角形最小路径和","frequency":2.5318584325,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":248379,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5726707831583843,"acs":527065,"articleLive":2,"columnArticles":3224,"formTitle":"[121]买卖股票的最佳时机","frequency":4.0787201028,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":920363,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.686496923846997,"acs":433391,"articleLive":2,"columnArticles":2529,"formTitle":"[122]买卖股票的最佳时机 II","frequency":3.3833338447,"frontendQuestionId":"122","leaf":true,"level":1,"nodeType":"def","questionId":"122","status":"","submitted":631308,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5325845295773199,"acs":124326,"articleLive":2,"columnArticles":792,"formTitle":"[123]买卖股票的最佳时机 III","frequency":2.8720868134,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":233439,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.442539060862483,"acs":147793,"articleLive":2,"columnArticles":1037,"formTitle":"[124]二叉树中的最大路径和","frequency":4.022976797,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":333966,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.4738631382126913,"acs":264835,"articleLive":2,"columnArticles":1778,"formTitle":"[125]验证回文串","frequency":3.2075760091,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":558885,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.3932235242095954,"acs":35571,"articleLive":2,"columnArticles":317,"formTitle":"[126]单词接龙 II","frequency":1.9925912299,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":90460,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.46690338401177045,"acs":119002,"articleLive":2,"columnArticles":629,"formTitle":"[127]单词接龙","frequency":2.430005062,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":254875,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5427267608358465,"acs":157108,"articleLive":2,"columnArticles":1031,"formTitle":"[128]最长连续序列","frequency":3.662750213,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":289479,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6793858645239788,"acs":112793,"articleLive":2,"columnArticles":1069,"formTitle":"[129]求根节点到叶节点数字之和","frequency":3.0685861091,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":166022,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.44144579725433314,"acs":120520,"articleLive":2,"columnArticles":1111,"formTitle":"[130]被围绕的区域","frequency":2.7807278718,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":273012,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7237769057781449,"acs":126163,"articleLive":2,"columnArticles":829,"formTitle":"[131]分割回文串","frequency":4.0847016974,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":174312,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.4928795434682022,"acs":47935,"articleLive":2,"columnArticles":428,"formTitle":"[132]分割回文串 II","frequency":3.1807871291,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":97255,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6753299649912236,"acs":69638,"articleLive":2,"columnArticles":507,"formTitle":"[133]克隆图","frequency":0.2768834642,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":103117,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5759358600017461,"acs":118743,"articleLive":2,"columnArticles":924,"formTitle":"[134]加油站","frequency":3.5113447354,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":206174,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.4851896107163072,"acs":92580,"articleLive":2,"columnArticles":740,"formTitle":"[135]分发糖果","frequency":4.1278585098,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"","submitted":190812,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7188631509473742,"acs":470529,"articleLive":2,"columnArticles":2144,"formTitle":"[136]只出现一次的数字","frequency":3.7418276381,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":654546,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7194583937804561,"acs":96706,"articleLive":2,"columnArticles":740,"formTitle":"[137]只出现一次的数字 II","frequency":3.5035625193,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":134415,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6586371034609834,"acs":107236,"articleLive":2,"columnArticles":832,"formTitle":"[138]复制带随机指针的链表","frequency":3.2919182261,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":162815,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5120442166524137,"acs":178430,"articleLive":2,"columnArticles":1137,"formTitle":"[139]单词拆分","frequency":3.7518199495,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":348466,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.48097803016724994,"acs":50988,"articleLive":2,"columnArticles":516,"formTitle":"[140]单词拆分 II","frequency":2.0263098659,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":106009,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.512101073042811,"acs":495234,"articleLive":2,"columnArticles":2583,"formTitle":"[141]环形链表","frequency":3.7700924496,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":967063,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5513273789226625,"acs":276478,"articleLive":2,"columnArticles":1625,"formTitle":"[142]环形链表 II","frequency":3.4581210658,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":501477,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6163124489742172,"acs":117010,"articleLive":2,"columnArticles":1023,"formTitle":"[143]重排链表","frequency":4.4009294402,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":189855,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7022733992575314,"acs":384777,"articleLive":2,"columnArticles":1744,"formTitle":"[144]二叉树的前序遍历","frequency":2.6354169983,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":547902,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7490940502838865,"acs":280099,"articleLive":2,"columnArticles":1473,"formTitle":"[145]二叉树的后序遍历","frequency":3.2070156501,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":373917,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5264404026963829,"acs":215232,"articleLive":2,"columnArticles":1311,"formTitle":"[146]LRU 缓存机制","frequency":4.4684937442,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":408844,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6803173393187368,"acs":96386,"articleLive":2,"columnArticles":759,"formTitle":"[147]对链表进行插入排序","frequency":2.3043300274,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":141678,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6675879946807616,"acs":198297,"articleLive":2,"columnArticles":1192,"formTitle":"[148]排序链表","frequency":3.8650263182,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":297035,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.33532320308731306,"acs":44488,"articleLive":2,"columnArticles":490,"formTitle":"[149]直线上最多的点数","frequency":3.1302840977,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":132672,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5368911205163654,"acs":126600,"articleLive":2,"columnArticles":1004,"formTitle":"[150]逆波兰表达式求值","frequency":3.3519044821,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":235802,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.4792839044002143,"acs":159267,"articleLive":2,"columnArticles":1359,"formTitle":"[151]翻转字符串里的单词","frequency":2.9408897333,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":332302,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.42001609200493095,"acs":170700,"articleLive":2,"columnArticles":1164,"formTitle":"[152]乘积最大子数组","frequency":3.6165697596,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":406413,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5652119605176873,"acs":199101,"articleLive":2,"columnArticles":1410,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":2.7248664523,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":352259,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.531908226515604,"acs":108638,"articleLive":2,"columnArticles":858,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":3.0989466681,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":204242,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5720736555764805,"acs":273394,"articleLive":2,"columnArticles":1529,"formTitle":"[155]最小栈","frequency":3.286710346,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":477900,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7263332937403492,"acs":6115,"articleLive":2,"columnArticles":105,"formTitle":"[156]上下翻转二叉树","frequency":0.8353654542,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"","submitted":8419,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5305232558139535,"acs":5110,"articleLive":2,"columnArticles":79,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"","submitted":9632,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5878884100703107,"acs":2592,"articleLive":2,"columnArticles":61,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.4265946251,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"","submitted":4409,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5394019183750235,"acs":14340,"articleLive":2,"columnArticles":178,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":2.088441647,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"","submitted":26585,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6113468459200193,"acs":314950,"articleLive":2,"columnArticles":1866,"formTitle":"[160]相交链表","frequency":3.5604041575,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":515174,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.3367121873386832,"acs":7175,"articleLive":2,"columnArticles":96,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.3041926436,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"","submitted":21309,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.4943905206101097,"acs":117660,"articleLive":2,"columnArticles":688,"formTitle":"[162]寻找峰值","frequency":2.9686324364,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":237990,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.3225099225099225,"acs":8532,"articleLive":2,"columnArticles":133,"formTitle":"[163]缺失的区间","frequency":0.8353654542,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"","submitted":26455,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6106921597949156,"acs":57173,"articleLive":2,"columnArticles":482,"formTitle":"[164]最大间距","frequency":2.9039950799,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":93620,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.48495415574029643,"acs":52151,"articleLive":2,"columnArticles":517,"formTitle":"[165]比较版本号","frequency":3.8960214497,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"","submitted":107538,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.2979849426861967,"acs":25450,"articleLive":2,"columnArticles":198,"formTitle":"[166]分数到小数","frequency":2.5148736074,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":85407,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5863083882923639,"acs":268925,"articleLive":2,"columnArticles":1760,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":2.7755465131,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":458675,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.43256511951977705,"acs":80708,"articleLive":2,"columnArticles":731,"formTitle":"[168]Excel表列名称","frequency":2.9828070182,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":186580,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6640651164145202,"acs":364848,"articleLive":2,"columnArticles":2083,"formTitle":"[169]多数元素","frequency":3.4734442964,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":549416,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.4163003568288773,"acs":8050,"articleLive":2,"columnArticles":79,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.2768834642,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"","submitted":19337,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7172416181767802,"acs":103541,"articleLive":2,"columnArticles":887,"formTitle":"[171]Excel 表列序号","frequency":1.0663107544,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":144360,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.43703520704241683,"acs":86682,"articleLive":2,"columnArticles":566,"formTitle":"[172]阶乘后的零","frequency":2.3043300274,"frontendQuestionId":"172","leaf":true,"level":1,"nodeType":"def","questionId":"172","status":"","submitted":198341,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8029847113746488,"acs":72585,"articleLive":2,"columnArticles":609,"formTitle":"[173]二叉搜索树迭代器","frequency":2.3598690077,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":90394,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4795715518819806,"acs":36669,"articleLive":2,"columnArticles":394,"formTitle":"[174]地下城游戏","frequency":3.0866886083,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":76462,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7396843915019035,"acs":289116,"articleLive":2,"columnArticles":1415,"formTitle":"[175]组合两个表","frequency":4.5347823318,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":390864,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.3561650154605273,"acs":239355,"articleLive":2,"columnArticles":972,"formTitle":"[176]第二高的薪水","frequency":4.5736802943,"frontendQuestionId":"176","leaf":true,"level":1,"nodeType":"def","questionId":"176","status":"","submitted":672034,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.4617633776512281,"acs":120656,"articleLive":2,"columnArticles":462,"formTitle":"[177]第N高的薪水","frequency":3.752924068,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":261294,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6013065245910417,"acs":112297,"articleLive":2,"columnArticles":636,"formTitle":"[178]分数排名","frequency":3.3833338447,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":186755,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4097401810966965,"acs":115028,"articleLive":2,"columnArticles":929,"formTitle":"[179]最大数","frequency":3.9160137554,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":280734,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.4869141597325937,"acs":82158,"articleLive":2,"columnArticles":471,"formTitle":"[180]连续出现的数字","frequency":3.5536195641,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":168732,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7032089946607869,"acs":154360,"articleLive":2,"columnArticles":639,"formTitle":"[181]超过经理收入的员工","frequency":3.4399420522,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":219508,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7971285342632826,"acs":171892,"articleLive":2,"columnArticles":550,"formTitle":"[182]查找重复的电子邮箱","frequency":3.0569589725,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":215639,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.677662326525362,"acs":142242,"articleLive":2,"columnArticles":521,"formTitle":"[183]从不订购的客户","frequency":2.2417313711,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":209901,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.47395252665648374,"acs":96501,"articleLive":2,"columnArticles":632,"formTitle":"[184]部门工资最高的员工","frequency":3.752924068,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":203609,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.49187150858601886,"acs":66654,"articleLive":2,"columnArticles":596,"formTitle":"[185]部门工资前三高的所有员工","frequency":3.6770577174,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":135511,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7529830437513083,"acs":7194,"articleLive":2,"columnArticles":105,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.3041926436,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"","submitted":9554,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.48186971225012937,"acs":40040,"articleLive":2,"columnArticles":265,"formTitle":"[187]重复的DNA序列","frequency":1.6719059297,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"","submitted":83093,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3880006077040297,"acs":84278,"articleLive":2,"columnArticles":660,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":2.4188715691,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":217211,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.4531883240873441,"acs":315899,"articleLive":2,"columnArticles":1568,"formTitle":"[189]旋转数组","frequency":3.1448684187,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":697059,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6950163800390027,"acs":125807,"articleLive":2,"columnArticles":790,"formTitle":"[190]颠倒二进制位","frequency":2.454311139,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":181013,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7469230737683067,"acs":182123,"articleLive":2,"columnArticles":1151,"formTitle":"[191]位1的个数","frequency":2.9295604781,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":243831,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3552141289367567,"acs":20877,"articleLive":2,"columnArticles":167,"formTitle":"[192]统计词频","frequency":2.7966391064,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":58773,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.32358094354693256,"acs":25117,"articleLive":2,"columnArticles":136,"formTitle":"[193]有效电话号码","frequency":1.9286395831,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":77622,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.34590141041753947,"acs":9908,"articleLive":2,"columnArticles":67,"formTitle":"[194]转置文件","frequency":1.4623744168,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":28644,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4357703743233971,"acs":34296,"articleLive":2,"columnArticles":139,"formTitle":"[195]第十行","frequency":2.5693047726,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":78702,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6646681356330255,"acs":96226,"articleLive":2,"columnArticles":363,"formTitle":"[196]删除重复的电子邮箱","frequency":2.88897358,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":144773,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.53343928114806,"acs":89286,"articleLive":2,"columnArticles":484,"formTitle":"[197]上升的温度","frequency":2.7906806785,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":167378,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5102802015920384,"acs":359944,"articleLive":2,"columnArticles":2518,"formTitle":"[198]打家劫舍","frequency":3.8663212861,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":705385,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6518973175426641,"acs":131062,"articleLive":2,"columnArticles":1506,"formTitle":"[199]二叉树的右视图","frequency":3.9977928924,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":201047,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5504479944750377,"acs":302873,"articleLive":2,"columnArticles":2018,"formTitle":"[200]岛屿数量","frequency":4.3177199966,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":550230,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5218634615595314,"acs":47631,"articleLive":2,"columnArticles":312,"formTitle":"[201]数字范围按位与","frequency":1.7815319859,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":91271,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.617746993242983,"acs":160356,"articleLive":2,"columnArticles":1316,"formTitle":"[202]快乐数","frequency":2.7261910786,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":259582,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5124585502262614,"acs":216977,"articleLive":2,"columnArticles":1551,"formTitle":"[203]移除链表元素","frequency":2.8184362983,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":423404,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.3794465293440521,"acs":162180,"articleLive":2,"columnArticles":707,"formTitle":"[204]计数质数","frequency":2.6368067753,"frontendQuestionId":"204","leaf":true,"level":1,"nodeType":"def","questionId":"204","status":"","submitted":427412,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5010732763365501,"acs":109246,"articleLive":2,"columnArticles":843,"formTitle":"[205]同构字符串","frequency":2.3650835995,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":218024,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7218428073998471,"acs":659856,"articleLive":2,"columnArticles":7148,"formTitle":"[206]反转链表","frequency":4.6527480212,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":914127,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5453338048323163,"acs":132623,"articleLive":2,"columnArticles":884,"formTitle":"[207]课程表","frequency":3.3833338447,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":243196,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7162013583111069,"acs":136142,"articleLive":2,"columnArticles":921,"formTitle":"[208]实现 Trie (前缀树)","frequency":3.1161115248,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":190089,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.46849721134196187,"acs":176065,"articleLive":2,"columnArticles":1256,"formTitle":"[209]长度最小的子数组","frequency":2.7503513819,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":375808,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5408783388954538,"acs":83305,"articleLive":2,"columnArticles":645,"formTitle":"[210]课程表 II","frequency":2.3598690077,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":154018,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.48140474283525436,"acs":27649,"articleLive":2,"columnArticles":302,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":1.6719059297,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":57434,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.45124222550823445,"acs":39976,"articleLive":2,"columnArticles":387,"formTitle":"[212]单词搜索 II","frequency":2.0263098659,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"","submitted":88591,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4318849658314351,"acs":151678,"articleLive":2,"columnArticles":1425,"formTitle":"[213]打家劫舍 II","frequency":3.522616461,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":351200,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.37065679653891875,"acs":30243,"articleLive":2,"columnArticles":296,"formTitle":"[214]最短回文串","frequency":2.866869569,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":81593,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6469991819252867,"acs":409676,"articleLive":2,"columnArticles":2176,"formTitle":"[215]数组中的第K个最大元素","frequency":4.3425287063,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":633194,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7398020023849349,"acs":92439,"articleLive":2,"columnArticles":974,"formTitle":"[216]组合总和 III","frequency":3.0391440768,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":124951,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5614692187612897,"acs":334141,"articleLive":2,"columnArticles":1547,"formTitle":"[217]存在重复元素","frequency":3.1848609523,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":595119,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5422855082912761,"acs":30086,"articleLive":2,"columnArticles":263,"formTitle":"[218]天际线问题","frequency":2.9828070182,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":55480,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4255584579173244,"acs":105407,"articleLive":2,"columnArticles":835,"formTitle":"[219]存在重复元素 II","frequency":2.088441647,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"","submitted":247691,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28701768599758787,"acs":62350,"articleLive":2,"columnArticles":411,"formTitle":"[220]存在重复元素 III","frequency":3.0266160384,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":217234,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.47164693202837127,"acs":129535,"articleLive":2,"columnArticles":937,"formTitle":"[221]最大正方形","frequency":3.5927552549,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":274644,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7796288934949885,"acs":109831,"articleLive":2,"columnArticles":843,"formTitle":"[222]完全二叉树的节点个数","frequency":1.9286395831,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":140876,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.45926797693303517,"acs":19512,"articleLive":2,"columnArticles":245,"formTitle":"[223]矩形面积","frequency":2.3372602337,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"","submitted":42485,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.41768604571860796,"acs":67369,"articleLive":2,"columnArticles":632,"formTitle":"[224]基本计算器","frequency":4.313522331,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":161291,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.675431440890744,"acs":127512,"articleLive":2,"columnArticles":4712,"formTitle":"[225]用队列实现栈","frequency":2.7000389606,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":188786,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7872547501603663,"acs":284728,"articleLive":2,"columnArticles":1762,"formTitle":"[226]翻转二叉树","frequency":3.722746073,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":361672,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.43680006012906275,"acs":81361,"articleLive":2,"columnArticles":678,"formTitle":"[227]基本计算器 II","frequency":3.6908450173,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":186266,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5816966461153839,"acs":54911,"articleLive":2,"columnArticles":619,"formTitle":"[228]汇总区间","frequency":1.1363444987,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":94398,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.4628157498768293,"acs":34757,"articleLive":2,"columnArticles":299,"formTitle":"[229]求众数 II","frequency":1.8127357656,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":75099,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7402157200098315,"acs":129500,"articleLive":2,"columnArticles":801,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":1.9133230025,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":174949,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5033854900334592,"acs":159023,"articleLive":2,"columnArticles":1154,"formTitle":"[231]2 的幂","frequency":2.2199629887,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":315907,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6907505319791483,"acs":148673,"articleLive":2,"columnArticles":1197,"formTitle":"[232]用栈实现队列","frequency":3.2701228939,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":215234,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.47589137794424835,"acs":33034,"articleLive":2,"columnArticles":401,"formTitle":"[233]数字 1 的个数","frequency":2.088441647,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":69415,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.4917825111919018,"acs":292317,"articleLive":2,"columnArticles":1887,"formTitle":"[234]回文链表","frequency":3.7142933292,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":594403,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6656541093067349,"acs":161501,"articleLive":2,"columnArticles":923,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":2.4016357064,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","submitted":242620,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6790137066843053,"acs":240214,"articleLive":2,"columnArticles":1306,"formTitle":"[236]二叉树的最近公共祖先","frequency":3.5927552549,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":353769,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8479444435080149,"acs":201224,"articleLive":2,"columnArticles":991,"formTitle":"[237]删除链表中的节点","frequency":2.6497771258,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":237308,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7223353662564125,"acs":131231,"articleLive":2,"columnArticles":826,"formTitle":"[238]除自身以外数组的乘积","frequency":2.6745793369,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":181676,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4960506921964323,"acs":180054,"articleLive":2,"columnArticles":1258,"formTitle":"[239]滑动窗口最大值","frequency":3.434131967,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":362975,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.4733414194433827,"acs":157271,"articleLive":2,"columnArticles":705,"formTitle":"[240]搜索二维矩阵 II","frequency":3.0831585284,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":332257,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7368434161042067,"acs":29585,"articleLive":2,"columnArticles":266,"formTitle":"[241]为运算表达式设计优先级","frequency":2.5279119417,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":40151,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6433767241683424,"acs":273567,"articleLive":2,"columnArticles":1578,"formTitle":"[242]有效的字母异位词","frequency":2.7000389606,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":425205,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6564513594216564,"acs":8354,"articleLive":2,"columnArticles":95,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"","submitted":12726,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5470317479051103,"acs":4635,"articleLive":2,"columnArticles":55,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"","submitted":8473,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.6115011202389843,"acs":4094,"articleLive":2,"columnArticles":55,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"","submitted":6695,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.4741235392320534,"acs":5396,"articleLive":2,"columnArticles":101,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"","submitted":11381,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5204016913319239,"acs":4923,"articleLive":2,"columnArticles":88,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"","submitted":9460,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.4659111679766039,"acs":2549,"articleLive":2,"columnArticles":50,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"","submitted":5471,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.637309374630571,"acs":5391,"articleLive":2,"columnArticles":94,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"","submitted":8459,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6343651861821444,"acs":4242,"articleLive":2,"columnArticles":72,"formTitle":"[250]统计同值子树","frequency":0.3041926436,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"","submitted":6687,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5413150772170037,"acs":3400,"articleLive":2,"columnArticles":65,"formTitle":"[251]展开二维向量","frequency":0.8058212079,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"","submitted":6281,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5608941938094275,"acs":11090,"articleLive":2,"columnArticles":146,"formTitle":"[252]会议室","frequency":0.3041926436,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"","submitted":19772,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.4964120447991416,"acs":29608,"articleLive":2,"columnArticles":317,"formTitle":"[253]会议室 II","frequency":2.6274381477,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"","submitted":59644,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5688878349537586,"acs":4798,"articleLive":2,"columnArticles":69,"formTitle":"[254]因子的组合","frequency":0.8353654542,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"","submitted":8434,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.4733608524527215,"acs":4931,"articleLive":2,"columnArticles":54,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"","submitted":10417,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.629359095193214,"acs":10684,"articleLive":2,"columnArticles":164,"formTitle":"[256]粉刷房子","frequency":0.3041926436,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"","submitted":16976,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6797949620103428,"acs":134475,"articleLive":2,"columnArticles":998,"formTitle":"[257]二叉树的所有路径","frequency":2.9295604781,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":197817,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6913762740321006,"acs":75770,"articleLive":2,"columnArticles":623,"formTitle":"[258]各位相加","frequency":2.3342186838,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":109593,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.567721626680279,"acs":6673,"articleLive":2,"columnArticles":81,"formTitle":"[259]较小的三数之和","frequency":0.2507039587,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"","submitted":11754,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7253608851762292,"acs":49495,"articleLive":2,"columnArticles":420,"formTitle":"[260]只出现一次的数字 III","frequency":2.4817853945,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":68235,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.49662795054327463,"acs":7953,"articleLive":2,"columnArticles":113,"formTitle":"[261]以图判树","frequency":1.2623366327,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"","submitted":16014,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.4384689340223531,"acs":36485,"articleLive":2,"columnArticles":354,"formTitle":"[262]行程和用户","frequency":3.0643251627,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":83210,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5154616638181168,"acs":103748,"articleLive":2,"columnArticles":815,"formTitle":"[263]丑数","frequency":2.6406390786,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":201272,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5778241608451185,"acs":94955,"articleLive":2,"columnArticles":590,"formTitle":"[264]丑数 II","frequency":2.9369904848,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":164332,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5789223605435713,"acs":6092,"articleLive":2,"columnArticles":126,"formTitle":"[265]粉刷房子 II","frequency":0.2255770086,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"","submitted":10523,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6690088363675077,"acs":6284,"articleLive":2,"columnArticles":98,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"","submitted":9393,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.44387965379859873,"acs":3231,"articleLive":2,"columnArticles":74,"formTitle":"[267]回文排列 II","frequency":0.3041926436,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"","submitted":7279,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6223414108777598,"acs":144461,"articleLive":2,"columnArticles":1048,"formTitle":"[268]丢失的数字","frequency":1.6398929527,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":232125,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.3402508551881414,"acs":5968,"articleLive":2,"columnArticles":99,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"","submitted":17540,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5496201615820572,"acs":9116,"articleLive":2,"columnArticles":132,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.8353654542,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"","submitted":16586,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5501964207769533,"acs":2521,"articleLive":2,"columnArticles":44,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"","submitted":4582,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6431840796019901,"acs":3232,"articleLive":2,"columnArticles":70,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.4610570293,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"","submitted":5025,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.30853748291452004,"acs":11738,"articleLive":2,"columnArticles":156,"formTitle":"[273]整数转换英文表示","frequency":1.8450487545,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"","submitted":38044,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.4403855739256055,"acs":52128,"articleLive":2,"columnArticles":556,"formTitle":"[274]H 指数","frequency":2.76335124,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":118369,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.46342647031375406,"acs":49658,"articleLive":2,"columnArticles":405,"formTitle":"[275]H 指数 II","frequency":1.5502271905,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":107154,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.48451677949013394,"acs":6728,"articleLive":2,"columnArticles":120,"formTitle":"[276]栅栏涂色","frequency":1.229022426,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"","submitted":13886,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5682250724038064,"acs":6867,"articleLive":2,"columnArticles":81,"formTitle":"[277]搜寻名人","frequency":0.3327171103,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"","submitted":12085,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.4548732828554421,"acs":158179,"articleLive":2,"columnArticles":916,"formTitle":"[278]第一个错误的版本","frequency":3.2459709292,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":347743,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6298448138460572,"acs":190472,"articleLive":2,"columnArticles":1139,"formTitle":"[279]完全平方数","frequency":3.4850215816,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":302411,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6864384971693258,"acs":5335,"articleLive":2,"columnArticles":69,"formTitle":"[280]摆动排序","frequency":0.8660803995,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"","submitted":7772,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7554988842843481,"acs":2370,"articleLive":2,"columnArticles":59,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"","submitted":3137,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.387997287522604,"acs":6866,"articleLive":2,"columnArticles":70,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","submitted":17696,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6390717982026644,"acs":449649,"articleLive":2,"columnArticles":3144,"formTitle":"[283]移动零","frequency":3.4841579193,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":703597,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7329792009576538,"acs":9797,"articleLive":2,"columnArticles":95,"formTitle":"[284]顶端迭代器","frequency":0.8353654542,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"","submitted":13366,"title":"顶端迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6359165677463117,"acs":7500,"articleLive":2,"columnArticles":95,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"","submitted":11794,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5064790818215475,"acs":10944,"articleLive":2,"columnArticles":138,"formTitle":"[286]墙与门","frequency":0.3938048023,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"ac","submitted":21608,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6629992452477844,"acs":170416,"articleLive":2,"columnArticles":1178,"formTitle":"[287]寻找重复数","frequency":2.9277755284,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":257038,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.42390035033086804,"acs":3267,"articleLive":2,"columnArticles":52,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"","submitted":7707,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7530314097881665,"acs":51545,"articleLive":2,"columnArticles":805,"formTitle":"[289]生命游戏","frequency":0.8660803995,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":68450,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.4570693163438629,"acs":78844,"articleLive":2,"columnArticles":1048,"formTitle":"[290]单词规律","frequency":1.2882112974,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":172499,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5357946870778928,"acs":2380,"articleLive":2,"columnArticles":50,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"","submitted":4442,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.6965155178695638,"acs":84114,"articleLive":2,"columnArticles":552,"formTitle":"[292]Nim 游戏","frequency":2.0568559182,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"","submitted":120764,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7106299212598425,"acs":4693,"articleLive":2,"columnArticles":78,"formTitle":"[293]翻转游戏","frequency":0.2768834642,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"","submitted":6604,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5865815798551225,"acs":3401,"articleLive":2,"columnArticles":49,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"","submitted":5798,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5214157536834152,"acs":44166,"articleLive":2,"columnArticles":350,"formTitle":"[295]数据流的中位数","frequency":3.0643251627,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":84704,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6185622317596566,"acs":2306,"articleLive":2,"columnArticles":41,"formTitle":"[296]最佳的碰头地点","frequency":1.2970141712,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"","submitted":3728,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5570743730637904,"acs":98542,"articleLive":2,"columnArticles":715,"formTitle":"[297]二叉树的序列化与反序列化","frequency":2.7906806785,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":176892,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5798575788402849,"acs":4560,"articleLive":2,"columnArticles":78,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"","submitted":7864,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5038054125275221,"acs":29060,"articleLive":2,"columnArticles":339,"formTitle":"[299]猜数字游戏","frequency":1.1969752486,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":57681,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.510192346929312,"acs":330072,"articleLive":2,"columnArticles":1876,"formTitle":"[300]最长递增子序列","frequency":3.7798650543,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":646956,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5221002517425034,"acs":30487,"articleLive":2,"columnArticles":217,"formTitle":"[301]删除无效的括号","frequency":2.4817853945,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":58393,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.672107363075807,"acs":1853,"articleLive":2,"columnArticles":32,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"","submitted":2757,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.723512757636492,"acs":125986,"articleLive":2,"columnArticles":775,"formTitle":"[303]区域和检索 - 数组不可变","frequency":3.0162158377,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":174131,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5381617056599688,"acs":59645,"articleLive":2,"columnArticles":544,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":2.8228926337,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":110831,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3767428625628379,"acs":3972,"articleLive":2,"columnArticles":60,"formTitle":"[305]岛屿数量 II","frequency":0.3041926436,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"","submitted":10543,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.336966336966337,"acs":16046,"articleLive":2,"columnArticles":238,"formTitle":"[306]累加数","frequency":1.9133230025,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":47619,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5437221343305049,"acs":22683,"articleLive":2,"columnArticles":220,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.8660803995,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":41718,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6043103448275862,"acs":2103,"articleLive":2,"columnArticles":39,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"","submitted":3480,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6039093389764437,"acs":108444,"articleLive":2,"columnArticles":878,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":3.4877037708,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":179570,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3790642494346198,"acs":20449,"articleLive":2,"columnArticles":203,"formTitle":"[310]最小高度树","frequency":2.0976668046,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":53946,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7633989922125516,"acs":3333,"articleLive":2,"columnArticles":43,"formTitle":"[311]稀疏矩阵的乘法","frequency":0.8980524322,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"","submitted":4366,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6821084422149137,"acs":53302,"articleLive":2,"columnArticles":364,"formTitle":"[312]戳气球","frequency":2.6324456694,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":78143,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6574833952025037,"acs":39497,"articleLive":2,"columnArticles":346,"formTitle":"[313]超级丑数","frequency":1.5920644034,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":60073,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5472394254842535,"acs":4153,"articleLive":2,"columnArticles":84,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"","submitted":7589,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.4187361438121917,"acs":48730,"articleLive":2,"columnArticles":468,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":2.7595095142,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":116374,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.47706428853475186,"acs":64033,"articleLive":2,"columnArticles":497,"formTitle":"[316]去除重复字母","frequency":2.756107456,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":134223,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.48511576626240355,"acs":3960,"articleLive":2,"columnArticles":62,"formTitle":"[317]离建筑物最近的距离","frequency":0.3041926436,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"","submitted":8163,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6820469798657718,"acs":18699,"articleLive":2,"columnArticles":163,"formTitle":"[318]最大单词长度乘积","frequency":0.3041926436,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":27416,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5154749947443414,"acs":22068,"articleLive":2,"columnArticles":211,"formTitle":"[319]灯泡开关","frequency":0.8353654542,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":42811,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6704084069739671,"acs":2807,"articleLive":2,"columnArticles":44,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"","submitted":4187,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.42594816947758124,"acs":25887,"articleLive":2,"columnArticles":222,"formTitle":"[321]拼接最大数","frequency":1.6398929527,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":60775,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.4422713814345039,"acs":282017,"articleLive":2,"columnArticles":1728,"formTitle":"[322]零钱兑换","frequency":3.8229881842,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":637656,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.634526671431356,"acs":9766,"articleLive":2,"columnArticles":131,"formTitle":"[323]无向图中连通分量的数目","frequency":1.6719059297,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"","submitted":15391,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.3766958544905755,"acs":23962,"articleLive":2,"columnArticles":161,"formTitle":"[324]摆动排序 II","frequency":1.8450487545,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"","submitted":63611,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5377717725095197,"acs":8756,"articleLive":2,"columnArticles":98,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":1.5791209144,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"","submitted":16282,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.4892694799195409,"acs":92674,"articleLive":2,"columnArticles":369,"formTitle":"[326]3的幂","frequency":1.1363444987,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"","submitted":189413,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.42467573889007015,"acs":23967,"articleLive":2,"columnArticles":200,"formTitle":"[327]区间和的个数","frequency":1.7754180025,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":56436,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6567498759066819,"acs":123048,"articleLive":2,"columnArticles":1027,"formTitle":"[328]奇偶链表","frequency":2.9408897333,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":187359,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.48210727371233897,"acs":52501,"articleLive":2,"columnArticles":462,"formTitle":"[329]矩阵中的最长递增路径","frequency":2.667902519,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":108899,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5344193529851176,"acs":18601,"articleLive":2,"columnArticles":147,"formTitle":"[330]按要求补齐数组","frequency":1.6398929527,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":34806,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.4798571319010003,"acs":43798,"articleLive":2,"columnArticles":493,"formTitle":"[331]验证二叉树的前序序列化","frequency":2.803436767,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":91273,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.44850793803405964,"acs":37319,"articleLive":2,"columnArticles":313,"formTitle":"[332]重新安排行程","frequency":2.2417313711,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","submitted":83207,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.46510388918486945,"acs":4365,"articleLive":2,"columnArticles":74,"formTitle":"[333]最大 BST 子树","frequency":0.8980524322,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"","submitted":9385,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.4134659317370974,"acs":42532,"articleLive":2,"columnArticles":276,"formTitle":"[334]递增的三元子序列","frequency":0.2255770086,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":102867,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.3695045822818435,"acs":2782,"articleLive":2,"columnArticles":35,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":7529,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.4015590940998264,"acs":21738,"articleLive":2,"columnArticles":185,"formTitle":"[336]回文对","frequency":1.6719059297,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":54134,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6091496595268067,"acs":122913,"articleLive":2,"columnArticles":893,"formTitle":"[337]打家劫舍 III","frequency":3.3554458131,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":201778,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7874357961280126,"acs":151468,"articleLive":2,"columnArticles":1321,"formTitle":"[338]比特位计数","frequency":3.3833338447,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":192356,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8094701240135288,"acs":3590,"articleLive":2,"columnArticles":57,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"","submitted":4435,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.49364774700667213,"acs":10802,"articleLive":2,"columnArticles":167,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":1.3709030133,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"","submitted":21882,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7270788285306621,"acs":49429,"articleLive":2,"columnArticles":478,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":3.4808452686,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":67983,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5151787790875595,"acs":84173,"articleLive":2,"columnArticles":750,"formTitle":"[342]4的幂","frequency":2.3043300274,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":163386,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6037827294757373,"acs":102154,"articleLive":2,"columnArticles":989,"formTitle":"[343]整数拆分","frequency":3.0508141824,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":169190,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7642018939588934,"acs":341437,"articleLive":2,"columnArticles":1816,"formTitle":"[344]反转字符串","frequency":3.3361886542,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":446789,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5383554453101681,"acs":104610,"articleLive":2,"columnArticles":1007,"formTitle":"[345]反转字符串中的元音字母","frequency":1.4308011549,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":194314,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7059288057344186,"acs":11621,"articleLive":2,"columnArticles":128,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"ac","submitted":16462,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6223036449996063,"acs":189713,"articleLive":2,"columnArticles":1402,"formTitle":"[347]前 K 个高频元素","frequency":3.7854931646,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"","submitted":304856,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6001822679338628,"acs":4610,"articleLive":2,"columnArticles":75,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"","submitted":7681,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.738144202764509,"acs":203513,"articleLive":2,"columnArticles":1433,"formTitle":"[349]两个数组的交集","frequency":3.3528715441,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":275709,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5491702410675544,"acs":231612,"articleLive":2,"columnArticles":1291,"formTitle":"[350]两个数组的交集 II","frequency":3.0745829488,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":421749,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.588796587337225,"acs":5245,"articleLive":2,"columnArticles":99,"formTitle":"[351]安卓系统手势解锁","frequency":0.966163858,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"","submitted":8908,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.5928942564246594,"acs":4222,"articleLive":2,"columnArticles":80,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"","submitted":7121,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.4247916666666667,"acs":2039,"articleLive":2,"columnArticles":47,"formTitle":"[353]贪吃蛇","frequency":0.3625522588,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"","submitted":4800,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.4505643585847623,"acs":66424,"articleLive":2,"columnArticles":516,"formTitle":"[354]俄罗斯套娃信封问题","frequency":3.702190983,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":147424,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4067914968251133,"acs":25049,"articleLive":2,"columnArticles":414,"formTitle":"[355]设计推特","frequency":1.8127357656,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":61577,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.3520730850316233,"acs":1503,"articleLive":2,"columnArticles":39,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"","submitted":4269,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5193589715749929,"acs":23917,"articleLive":2,"columnArticles":369,"formTitle":"[357]计算各个位数不同的数字个数","frequency":2.1704854006,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":46051,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.35185644587778053,"acs":4255,"articleLive":2,"columnArticles":58,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"","submitted":12093,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7241158585373659,"acs":4525,"articleLive":2,"columnArticles":52,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"","submitted":6249,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6057065827903841,"acs":2696,"articleLive":2,"columnArticles":59,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"","submitted":4451,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5652901785714286,"acs":3039,"articleLive":2,"columnArticles":59,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"","submitted":5376,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6962371721778792,"acs":3053,"articleLive":2,"columnArticles":59,"formTitle":"[362]敲击计数器","frequency":0.3625522588,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"","submitted":4385,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.49066027217326225,"acs":32125,"articleLive":2,"columnArticles":212,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":2.7332867038,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":65473,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7170590665014457,"acs":1736,"articleLive":2,"columnArticles":47,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"","submitted":2421,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3634860389754517,"acs":32753,"articleLive":2,"columnArticles":474,"formTitle":"[365]水壶问题","frequency":2.088441647,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":90108,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.764905021628738,"acs":4067,"articleLive":2,"columnArticles":117,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"","submitted":5317,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4391314349363165,"acs":72541,"articleLive":2,"columnArticles":572,"formTitle":"[367]有效的完全平方数","frequency":0.2014329097,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":165192,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.4588725473545962,"acs":40529,"articleLive":2,"columnArticles":441,"formTitle":"[368]最大整除子集","frequency":3.4180836927,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":88323,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6161601817665436,"acs":4339,"articleLive":2,"columnArticles":117,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"","submitted":7042,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7174022066198595,"acs":2861,"articleLive":2,"columnArticles":43,"formTitle":"[370]区间加法","frequency":0.3041926436,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"","submitted":3988,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.5792672338947734,"acs":53376,"articleLive":2,"columnArticles":307,"formTitle":"[371]两整数之和","frequency":2.3372602337,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":92144,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5063640140499301,"acs":13407,"articleLive":2,"columnArticles":132,"formTitle":"[372]超级次方","frequency":0.3041926436,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":26477,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4279671849217969,"acs":18415,"articleLive":2,"columnArticles":184,"formTitle":"[373]查找和最小的K对数字","frequency":2.2022005323,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":43029,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5141333882786241,"acs":79848,"articleLive":2,"columnArticles":546,"formTitle":"[374]猜数字大小","frequency":1.6719059297,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":155306,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.4668951290923609,"acs":14033,"articleLive":2,"columnArticles":116,"formTitle":"[375]猜数字大小 II","frequency":1.6719059297,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":30056,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.46159417904059524,"acs":70100,"articleLive":2,"columnArticles":767,"formTitle":"[376]摆动序列","frequency":1.5791209144,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"","submitted":151865,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5068155231168303,"acs":59787,"articleLive":2,"columnArticles":517,"formTitle":"[377]组合总和 Ⅳ","frequency":2.88897358,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":117966,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6390039767716601,"acs":76807,"articleLive":2,"columnArticles":547,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":2.5279119417,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":120198,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6455696202531646,"acs":2907,"articleLive":2,"columnArticles":65,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"","submitted":4503,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5019649874955341,"acs":32315,"articleLive":2,"columnArticles":199,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":1.6719059297,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":64377,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44333155365723437,"acs":20759,"articleLive":2,"columnArticles":173,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.3041926436,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":46825,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6262802260847393,"acs":14737,"articleLive":2,"columnArticles":117,"formTitle":"[382]链表随机节点","frequency":1.4951320132,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":23531,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.5937453988633352,"acs":60489,"articleLive":2,"columnArticles":661,"formTitle":"[383]赎金信","frequency":0.7234701728,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":101877,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5748494390632296,"acs":48012,"articleLive":2,"columnArticles":187,"formTitle":"[384]打乱数组","frequency":2.7000389606,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":83521,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.41460417763735297,"acs":7086,"articleLive":2,"columnArticles":82,"formTitle":"[385]迷你语法分析器","frequency":0.2507039587,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":17091,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.746,"acs":20888,"articleLive":2,"columnArticles":227,"formTitle":"[386]字典序排数","frequency":2.6656476758,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":28000,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5299790559374634,"acs":208003,"articleLive":2,"columnArticles":1128,"formTitle":"[387]字符串中的第一个唯一字符","frequency":2.9408897333,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":392474,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5235986811116344,"acs":5558,"articleLive":2,"columnArticles":101,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":10615,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.692504726909493,"acs":97058,"articleLive":2,"columnArticles":958,"formTitle":"[389]找不同","frequency":1.1363444987,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":140155,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.4665928131274666,"acs":6739,"articleLive":2,"columnArticles":92,"formTitle":"[390]消除游戏","frequency":1.7051051014,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":14443,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.35384490326776136,"acs":4353,"articleLive":2,"columnArticles":64,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":12302,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5142173345318286,"acs":139013,"articleLive":2,"columnArticles":1515,"formTitle":"[392]判断子序列","frequency":2.7906806785,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"","submitted":270339,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3911466158525413,"acs":10674,"articleLive":2,"columnArticles":125,"formTitle":"[393]UTF-8 编码验证","frequency":1.7051051014,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":27289,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5510239727522815,"acs":113571,"articleLive":2,"columnArticles":1238,"formTitle":"[394]字符串解码","frequency":4.1713040485,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":206109,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5201138559784892,"acs":49519,"articleLive":2,"columnArticles":418,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":3.1102258312,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":95208,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.4226199280185377,"acs":8572,"articleLive":2,"columnArticles":141,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":20283,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.37801503602380704,"acs":14481,"articleLive":2,"columnArticles":177,"formTitle":"[397]整数替换","frequency":1.1969752486,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":38308,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6521321090332196,"acs":13565,"articleLive":2,"columnArticles":114,"formTitle":"[398]随机数索引","frequency":1.9925912299,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":20801,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5920841373418374,"acs":40196,"articleLive":2,"columnArticles":510,"formTitle":"[399]除法求值","frequency":1.4308011549,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":67889,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.4128438271040848,"acs":18071,"articleLive":2,"columnArticles":188,"formTitle":"[400]第 N 位数字","frequency":2.3043300274,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":43772,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6137087274466124,"acs":52620,"articleLive":2,"columnArticles":652,"formTitle":"[401]二进制手表","frequency":2.4498082495,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":85741,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.3279340466884518,"acs":76771,"articleLive":2,"columnArticles":563,"formTitle":"[402]移掉 K 位数字","frequency":3.3497736482,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":234105,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.45622001722087824,"acs":44507,"articleLive":2,"columnArticles":450,"formTitle":"[403]青蛙过河","frequency":3.300812821,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":97556,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5815100458056681,"acs":94325,"articleLive":2,"columnArticles":1072,"formTitle":"[404]左叶子之和","frequency":2.76335124,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":162207,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5229902404668477,"acs":25990,"articleLive":2,"columnArticles":267,"formTitle":"[405]数字转换为十六进制数","frequency":2.2350262367,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"","submitted":49695,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7350186716718478,"acs":112782,"articleLive":2,"columnArticles":765,"formTitle":"[406]根据身高重建队列","frequency":2.7530736572,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":153441,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.48223017593386097,"acs":9566,"articleLive":2,"columnArticles":124,"formTitle":"[407]接雨水 II","frequency":2.2350262367,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":19837,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3247528628755995,"acs":3318,"articleLive":2,"columnArticles":76,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"","submitted":10217,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5551871210276201,"acs":88906,"articleLive":2,"columnArticles":1265,"formTitle":"[409]最长回文串","frequency":3.1475849259,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":160137,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.561134974892613,"acs":37100,"articleLive":2,"columnArticles":300,"formTitle":"[410]分割数组的最大值","frequency":3.4841579193,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":66116,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.49510086455331415,"acs":859,"articleLive":2,"columnArticles":21,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"","submitted":1735,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.6722985836125495,"acs":70629,"articleLive":2,"columnArticles":356,"formTitle":"[412]Fizz Buzz","frequency":1.1969752486,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"","submitted":105056,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6858580618385557,"acs":66103,"articleLive":2,"columnArticles":868,"formTitle":"[413]等差数列划分","frequency":1.8127357656,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":96380,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.36457496559497343,"acs":58546,"articleLive":2,"columnArticles":808,"formTitle":"[414]第三大的数","frequency":1.8127357656,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":160587,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5350971001689372,"acs":138100,"articleLive":2,"columnArticles":1021,"formTitle":"[415]字符串相加","frequency":4.3303658782,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":258084,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5059463358611984,"acs":159918,"articleLive":2,"columnArticles":922,"formTitle":"[416]分割等和子集","frequency":3.21607972,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":316077,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.47593762853830907,"acs":25456,"articleLive":2,"columnArticles":295,"formTitle":"[417]太平洋大西洋水流问题","frequency":2.8562159835,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":53486,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.35978279908915745,"acs":2054,"articleLive":2,"columnArticles":32,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"","submitted":5709,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7564658001837994,"acs":11524,"articleLive":2,"columnArticles":149,"formTitle":"[419]甲板上的战舰","frequency":0.7773697867,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":15234,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20551242236024844,"acs":2647,"articleLive":2,"columnArticles":49,"formTitle":"[420]强密码检验器","frequency":1.0018055493,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":12880,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6222811977153406,"acs":32358,"articleLive":2,"columnArticles":296,"formTitle":"[421]数组中两个数的最大异或值","frequency":2.890728767,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":51999,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.4264133669031815,"acs":1863,"articleLive":2,"columnArticles":44,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"","submitted":4369,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.569508639692811,"acs":8009,"articleLive":2,"columnArticles":133,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":14063,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5300023548048723,"acs":49516,"articleLive":2,"columnArticles":440,"formTitle":"[424]替换后的最长重复字符","frequency":3.1206394927,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"","submitted":93426,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6110183639398998,"acs":1464,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"","submitted":2396,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6686633039092056,"acs":6363,"articleLive":2,"columnArticles":111,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":1.4003342134,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"","submitted":9516,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6129131912264443,"acs":3968,"articleLive":2,"columnArticles":64,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6474,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6472898664571878,"acs":2472,"articleLive":2,"columnArticles":52,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"","submitted":3819,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6975885017333434,"acs":55136,"articleLive":2,"columnArticles":440,"formTitle":"[429]N 叉树的层序遍历","frequency":1.0529937962,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":79038,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5406820761531318,"acs":20959,"articleLive":2,"columnArticles":300,"formTitle":"[430]扁平化多级双向链表","frequency":1.4623744168,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":38764,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7260018639328985,"acs":779,"articleLive":2,"columnArticles":27,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"","submitted":1073,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.3774535966316788,"acs":6365,"articleLive":2,"columnArticles":84,"formTitle":"[432]全 O(1) 的数据结构","frequency":0.9313777419,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":16863,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5331677899964526,"acs":15030,"articleLive":2,"columnArticles":205,"formTitle":"[433]最小基因变化","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":28190,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3740392912327173,"acs":37279,"articleLive":2,"columnArticles":510,"formTitle":"[434]字符串中的单词数","frequency":1.4308011549,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"","submitted":99666,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5101948135123491,"acs":87628,"articleLive":2,"columnArticles":795,"formTitle":"[435]无重叠区间","frequency":3.0391440768,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"","submitted":171754,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.48599670510708404,"acs":8260,"articleLive":2,"columnArticles":138,"formTitle":"[436]寻找右区间","frequency":0.3327171103,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":16996,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5668042959570645,"acs":94310,"articleLive":2,"columnArticles":785,"formTitle":"[437]路径总和 III","frequency":2.5774867851,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"","submitted":166389,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5157087386798058,"acs":85931,"articleLive":2,"columnArticles":734,"formTitle":"[438]找到字符串中所有字母异位词","frequency":2.4016357064,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":166627,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5882229673093042,"acs":2807,"articleLive":2,"columnArticles":66,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"","submitted":4772,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.37949440284676406,"acs":15357,"articleLive":2,"columnArticles":117,"formTitle":"[440]字典序的第K小数字","frequency":3.4193478195,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":40467,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4258123561157867,"acs":45131,"articleLive":2,"columnArticles":450,"formTitle":"[441]排列硬币","frequency":1.1969752486,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":105988,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6959914138230634,"acs":40854,"articleLive":2,"columnArticles":400,"formTitle":"[442]数组中重复的数据","frequency":3.0989466681,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":58699,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.4759079274731962,"acs":53177,"articleLive":2,"columnArticles":666,"formTitle":"[443]压缩字符串","frequency":1.9940975038,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"","submitted":111738,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.24797610626424585,"acs":3155,"articleLive":2,"columnArticles":50,"formTitle":"[444]序列重建","frequency":0.8980524322,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"","submitted":12723,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5874247750700113,"acs":78870,"articleLive":2,"columnArticles":903,"formTitle":"[445]两数相加 II","frequency":3.3833338447,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":134264,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5515610773342732,"acs":18779,"articleLive":2,"columnArticles":167,"formTitle":"[446]等差数列划分 II - 子序列","frequency":1.320942574,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":34047,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6040592970061961,"acs":20863,"articleLive":2,"columnArticles":162,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"","submitted":34538,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6469102341177115,"acs":129842,"articleLive":2,"columnArticles":1029,"formTitle":"[448]找到所有数组中消失的数字","frequency":2.9558184688,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":200711,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5538620610423927,"acs":14463,"articleLive":2,"columnArticles":132,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.3041926436,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":26113,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.48374481428307187,"acs":54921,"articleLive":2,"columnArticles":574,"formTitle":"[450]删除二叉搜索树中的节点","frequency":2.2472531963,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":113533,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7108752591945869,"acs":78165,"articleLive":2,"columnArticles":907,"formTitle":"[451]根据字符出现频率排序","frequency":2.8687884398,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":109956,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5093403122461871,"acs":90304,"articleLive":2,"columnArticles":793,"formTitle":"[452]用最少数量的箭引爆气球","frequency":2.3650835995,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":177296,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5540284259200068,"acs":26000,"articleLive":2,"columnArticles":289,"formTitle":"[453]最小操作次数使数组元素相等","frequency":1.4003342134,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","submitted":46929,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.5993459494553587,"acs":74775,"articleLive":2,"columnArticles":464,"formTitle":"[454]四数相加 II","frequency":2.667902519,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"","submitted":124761,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5774911772069097,"acs":143018,"articleLive":2,"columnArticles":1172,"formTitle":"[455]分发饼干","frequency":2.7854150142,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"","submitted":247654,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.3621485054303245,"acs":55186,"articleLive":2,"columnArticles":441,"formTitle":"[456]132 模式","frequency":3.5073314863,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":152385,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.4350268380976158,"acs":27880,"articleLive":2,"columnArticles":329,"formTitle":"[457]环形数组是否存在循环","frequency":1.4748288085,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":64088,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6075233336475913,"acs":6444,"articleLive":2,"columnArticles":59,"formTitle":"[458]可怜的小猪","frequency":0.8058212079,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":10607,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5114896775064094,"acs":75813,"articleLive":2,"columnArticles":615,"formTitle":"[459]重复的子字符串","frequency":2.5599501674,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":148220,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4397757929019723,"acs":31462,"articleLive":2,"columnArticles":386,"formTitle":"[460]LFU 缓存","frequency":3.0508141824,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":71541,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8115005002165117,"acs":163041,"articleLive":2,"columnArticles":1311,"formTitle":"[461]汉明距离","frequency":2.7982532597,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":200913,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6028115535867649,"acs":13336,"articleLive":2,"columnArticles":122,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":1.8450487545,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":22123,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7150184494716303,"acs":74023,"articleLive":2,"columnArticles":882,"formTitle":"[463]岛屿的周长","frequency":1.8127357656,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":103526,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.35830895857424666,"acs":10535,"articleLive":2,"columnArticles":105,"formTitle":"[464]我能赢吗","frequency":1.8785489841,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":29402,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5285864608909154,"acs":1507,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"","submitted":2851,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.3736005483565623,"acs":11446,"articleLive":2,"columnArticles":178,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":30637,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44016549968173135,"acs":8298,"articleLive":2,"columnArticles":109,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.8353654542,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":18852,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.24783971029891688,"acs":22859,"articleLive":2,"columnArticles":286,"formTitle":"[468]验证IP地址","frequency":2.4817853945,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":92233,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4382520582647245,"acs":1384,"articleLive":2,"columnArticles":20,"formTitle":"[469]凸多边形","frequency":1.229022426,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"","submitted":3158,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5558229480017189,"acs":32335,"articleLive":2,"columnArticles":155,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":3.1302840977,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"","submitted":58175,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6193152784874808,"acs":1212,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":0.6036237946,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"","submitted":1957,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.4113349131121643,"acs":6249,"articleLive":2,"columnArticles":78,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":15192,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.4196822120449805,"acs":19519,"articleLive":2,"columnArticles":171,"formTitle":"[473]火柴拼正方形","frequency":1.9600604803,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":46509,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6097556798232469,"acs":71203,"articleLive":2,"columnArticles":577,"formTitle":"[474]一和零","frequency":3.1779767175,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":116773,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.32936987773747145,"acs":19612,"articleLive":2,"columnArticles":227,"formTitle":"[475]供暖器","frequency":1.4623744168,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":59544,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7011127256041603,"acs":36671,"articleLive":2,"columnArticles":460,"formTitle":"[476]数字的补数","frequency":0.2507039587,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","submitted":52304,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6035684503673867,"acs":38361,"articleLive":2,"columnArticles":327,"formTitle":"[477]汉明距离总和","frequency":2.3043300274,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":63557,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.43590108015918133,"acs":6134,"articleLive":2,"columnArticles":48,"formTitle":"[478]在圆内随机生成点","frequency":1.4951320132,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":14072,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.4132394366197183,"acs":2934,"articleLive":2,"columnArticles":23,"formTitle":"[479]最大回文数乘积","frequency":0.4610570293,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"","submitted":7100,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.4484615744860207,"acs":28728,"articleLive":2,"columnArticles":400,"formTitle":"[480]滑动窗口中位数","frequency":2.1901811569,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":64059,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5343250577947533,"acs":5316,"articleLive":2,"columnArticles":93,"formTitle":"[481]神奇字符串","frequency":0.2768834642,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":9949,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.42504678078868946,"acs":18399,"articleLive":2,"columnArticles":217,"formTitle":"[482]密钥格式化","frequency":0.7499407495,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"","submitted":43287,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5897285227406276,"acs":15054,"articleLive":2,"columnArticles":114,"formTitle":"[483]最小好进制","frequency":1.5502271905,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"notac","submitted":25527,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6419294990723562,"acs":1384,"articleLive":2,"columnArticles":33,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"","submitted":2156,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6059008614019704,"acs":117466,"articleLive":2,"columnArticles":950,"formTitle":"[485]最大连续 1 的个数","frequency":2.4188715691,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":193870,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5881717597471022,"acs":44654,"articleLive":2,"columnArticles":394,"formTitle":"[486]预测赢家","frequency":2.0263098659,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":75920,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5786748264093209,"acs":4917,"articleLive":2,"columnArticles":97,"formTitle":"[487]最大连续1的个数 II","frequency":1.8127357656,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"","submitted":8497,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.3894972330154245,"acs":3308,"articleLive":2,"columnArticles":69,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":8493,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.718409843823947,"acs":1518,"articleLive":2,"columnArticles":23,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"","submitted":2113,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.4830515018145317,"acs":6256,"articleLive":2,"columnArticles":73,"formTitle":"[490]迷宫","frequency":0.3625522588,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"","submitted":12951,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5477211962942237,"acs":44045,"articleLive":2,"columnArticles":376,"formTitle":"[491]递增子序列","frequency":2.5279119417,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":80415,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5495685860186652,"acs":18726,"articleLive":2,"columnArticles":173,"formTitle":"[492]构造矩形","frequency":0.2768834642,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":34074,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.34396512771443,"acs":25882,"articleLive":2,"columnArticles":264,"formTitle":"[493]翻转对","frequency":1.9133230025,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":75246,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.5004137702747434,"acs":139081,"articleLive":2,"columnArticles":986,"formTitle":"[494]目标和","frequency":3.5726656859,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":277932,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5411697667792746,"acs":26592,"articleLive":2,"columnArticles":406,"formTitle":"[495]提莫攻击","frequency":1.1969752486,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":49138,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6869574046809159,"acs":94717,"articleLive":2,"columnArticles":984,"formTitle":"[496]下一个更大元素 I","frequency":2.6274381477,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":137879,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.403529240192504,"acs":2767,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":6857,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4591465693992909,"acs":40533,"articleLive":2,"columnArticles":420,"formTitle":"[498]对角线遍历","frequency":2.667902519,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":88279,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.367827868852459,"acs":2513,"articleLive":2,"columnArticles":47,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"","submitted":6832,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7076240360832242,"acs":29181,"articleLive":2,"columnArticles":441,"formTitle":"[500]键盘行","frequency":0.8058212079,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":41238,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5105259689986328,"acs":61985,"articleLive":2,"columnArticles":516,"formTitle":"[501]二叉搜索树中的众数","frequency":2.2119282355,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":121414,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.4169751116783663,"acs":6534,"articleLive":2,"columnArticles":89,"formTitle":"[502]IPO","frequency":1.5291604751,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"","submitted":15670,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6333151510428843,"acs":97528,"articleLive":2,"columnArticles":943,"formTitle":"[503]下一个更大元素 II","frequency":3.2029905279,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":153996,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5050644889948128,"acs":28821,"articleLive":2,"columnArticles":305,"formTitle":"[504]七进制数","frequency":1.1969752486,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":57064,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.48233038078714274,"acs":5282,"articleLive":2,"columnArticles":64,"formTitle":"[505]迷宫 II","frequency":0.8980524322,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"","submitted":10951,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.562755333635951,"acs":19836,"articleLive":2,"columnArticles":268,"formTitle":"[506]相对名次","frequency":0.7499407495,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":35248,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4082141814998541,"acs":27979,"articleLive":2,"columnArticles":221,"formTitle":"[507]完美数","frequency":1.1661086006,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":68540,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6735856342923344,"acs":13954,"articleLive":2,"columnArticles":197,"formTitle":"[508]出现次数最多的子树元素和","frequency":0.8660803995,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":20716,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6777443885877621,"acs":217192,"articleLive":2,"columnArticles":1364,"formTitle":"[509]斐波那契数","frequency":3.1826182458,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","submitted":320463,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6123529411764705,"acs":3123,"articleLive":2,"columnArticles":53,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.3938048023,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"","submitted":5100,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7337144764845804,"acs":17582,"articleLive":2,"columnArticles":99,"formTitle":"[511]游戏玩法分析 I","frequency":1.8450487545,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"","submitted":23963,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.537329330880217,"acs":16647,"articleLive":2,"columnArticles":142,"formTitle":"[512]游戏玩法分析 II","frequency":0.2768834642,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"","submitted":30981,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7305040455876334,"acs":46406,"articleLive":2,"columnArticles":525,"formTitle":"[513]找树左下角的值","frequency":0.2255770086,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":63526,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5018233334207833,"acs":19128,"articleLive":2,"columnArticles":234,"formTitle":"[514]自由之路","frequency":2.4996909759,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":38117,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6431036988590946,"acs":35399,"articleLive":2,"columnArticles":389,"formTitle":"[515]在每个树行中找最大值","frequency":1.7051051014,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":55044,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6510232569530044,"acs":79751,"articleLive":2,"columnArticles":588,"formTitle":"[516]最长回文子序列","frequency":1.7544951456,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":122501,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.4399756246191347,"acs":3610,"articleLive":2,"columnArticles":45,"formTitle":"[517]超级洗衣机","frequency":0.2768834642,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"","submitted":8205,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6500891277409265,"acs":98103,"articleLive":2,"columnArticles":642,"formTitle":"[518]零钱兑换 II","frequency":3.4935167268,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":150907,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.39493316754740443,"acs":2541,"articleLive":2,"columnArticles":36,"formTitle":"[519]随机翻转矩阵","frequency":0.9313777419,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":6434,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5627873710023501,"acs":38556,"articleLive":2,"columnArticles":618,"formTitle":"[520]检测大写字母","frequency":0.8058212079,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":68509,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7120397664874862,"acs":24638,"articleLive":2,"columnArticles":241,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.8353654542,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":34602,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.35794569330069,"acs":6433,"articleLive":2,"columnArticles":100,"formTitle":"[522]最长特殊序列 II","frequency":0.8353654542,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":17972,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2743031782824242,"acs":66507,"articleLive":2,"columnArticles":586,"formTitle":"[523]连续的子数组和","frequency":2.8562159835,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":242458,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.4729455216989843,"acs":38415,"articleLive":2,"columnArticles":367,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":1.6719059297,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"","submitted":81225,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5365141428889604,"acs":43360,"articleLive":2,"columnArticles":498,"formTitle":"[525]连续数组","frequency":3.3833338447,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":80818,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7342908849334524,"acs":32054,"articleLive":2,"columnArticles":376,"formTitle":"[526]优美的排列","frequency":1.6611071552,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":43653,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5756126718469815,"acs":1926,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"","submitted":3346,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.4694976076555024,"acs":9420,"articleLive":2,"columnArticles":91,"formTitle":"[528]按权重随机选择","frequency":1.1363444987,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"","submitted":20064,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6464944399240575,"acs":38138,"articleLive":2,"columnArticles":455,"formTitle":"[529]扫雷游戏","frequency":1.7754180025,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":58992,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6205937923973931,"acs":74560,"articleLive":2,"columnArticles":618,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.8058212079,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":120143,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6636176964719059,"acs":3555,"articleLive":2,"columnArticles":74,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"","submitted":5357,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.3720420091049777,"acs":24762,"articleLive":2,"columnArticles":264,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.8353654542,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":66557,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5267461669505963,"acs":1546,"articleLive":2,"columnArticles":33,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"","submitted":2935,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6764190790151438,"acs":13132,"articleLive":2,"columnArticles":131,"formTitle":"[534]游戏玩法分析 III","frequency":0.8058212079,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"","submitted":19414,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8416657510163719,"acs":15320,"articleLive":2,"columnArticles":93,"formTitle":"[535]TinyURL 的加密与解密","frequency":1.4951320132,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":18202,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5344891871737509,"acs":2867,"articleLive":2,"columnArticles":45,"formTitle":"[536]从字符串生成二叉树","frequency":0.3938048023,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"","submitted":5364,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7109523207284685,"acs":11243,"articleLive":2,"columnArticles":164,"formTitle":"[537]复数乘法","frequency":0.3041926436,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":15814,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.6946516660618036,"acs":103360,"articleLive":2,"columnArticles":787,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":1.7221761885,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":148794,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5937247870909906,"acs":13246,"articleLive":2,"columnArticles":168,"formTitle":"[539]最小时间差","frequency":1.4003342134,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":22310,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5811170864867515,"acs":35551,"articleLive":2,"columnArticles":370,"formTitle":"[540]有序数组中的单一元素","frequency":2.2690405504,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":61177,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.608215603347431,"acs":67591,"articleLive":2,"columnArticles":768,"formTitle":"[541]反转字符串 II","frequency":1.407851209,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":111130,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.45938150352331225,"acs":62910,"articleLive":2,"columnArticles":595,"formTitle":"[542]01 矩阵","frequency":2.088441647,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":136945,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5481550069938336,"acs":139119,"articleLive":2,"columnArticles":1176,"formTitle":"[543]二叉树的直径","frequency":3.5000161648,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":253795,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7098646034816247,"acs":2202,"articleLive":2,"columnArticles":49,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"","submitted":3102,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.41615930999492645,"acs":3281,"articleLive":2,"columnArticles":74,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"","submitted":7884,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6309873547068591,"acs":14820,"articleLive":2,"columnArticles":118,"formTitle":"[546]移除盒子","frequency":1.229022426,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":23487,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6179701995608526,"acs":152541,"articleLive":2,"columnArticles":1071,"formTitle":"[547]省份数量","frequency":2.7807278718,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":246842,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.35666435666435664,"acs":1544,"articleLive":2,"columnArticles":39,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"","submitted":4329,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.48427049789447607,"acs":1955,"articleLive":2,"columnArticles":47,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"","submitted":4037,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4385565052231719,"acs":11545,"articleLive":2,"columnArticles":166,"formTitle":"[550]游戏玩法分析 IV","frequency":1.4308011549,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"","submitted":26325,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.566835921647811,"acs":57268,"articleLive":2,"columnArticles":734,"formTitle":"[551]学生出勤记录 I","frequency":1.0206243207,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":101031,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5782691972836497,"acs":23247,"articleLive":2,"columnArticles":284,"formTitle":"[552]学生出勤记录 II","frequency":1.5222486422,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":40201,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6020091909800149,"acs":5633,"articleLive":2,"columnArticles":80,"formTitle":"[553]最优除法","frequency":0.2768834642,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":9357,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5002217799260733,"acs":43982,"articleLive":2,"columnArticles":481,"formTitle":"[554]砖墙","frequency":2.9322912281,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":87925,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3414012738853503,"acs":1072,"articleLive":2,"columnArticles":21,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"","submitted":3140,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.32457386363636365,"acs":13710,"articleLive":2,"columnArticles":204,"formTitle":"[556]下一个更大元素 III","frequency":2.4996909759,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":42240,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7449543427694996,"acs":146683,"articleLive":2,"columnArticles":1183,"formTitle":"[557]反转字符串中的单词 III","frequency":2.9039950799,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":196902,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5015100373068041,"acs":2823,"articleLive":2,"columnArticles":35,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5629,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7266159221362616,"acs":58231,"articleLive":2,"columnArticles":534,"formTitle":"[559]N 叉树的最大深度","frequency":1.6089881446,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":80140,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.44702573151102065,"acs":138582,"articleLive":2,"columnArticles":859,"formTitle":"[560]和为K的子数组","frequency":3.8556590947,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":310009,"title":"和为K的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7732888975554413,"acs":87244,"articleLive":2,"columnArticles":725,"formTitle":"[561]数组拆分 I","frequency":1.1363444987,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"","submitted":112822,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.45994599459945995,"acs":3577,"articleLive":2,"columnArticles":51,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"","submitted":7777,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6040030255425612,"acs":31143,"articleLive":2,"columnArticles":312,"formTitle":"[563]二叉树的坡度","frequency":1.4003342134,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":51561,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.1783645369826211,"acs":4249,"articleLive":2,"columnArticles":74,"formTitle":"[564]寻找最近的回文数","frequency":0.8660803995,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":23822,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6097209071644348,"acs":13523,"articleLive":2,"columnArticles":133,"formTitle":"[565]数组嵌套","frequency":0.8058212079,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":22179,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6969430564983697,"acs":62628,"articleLive":2,"columnArticles":578,"formTitle":"[566]重塑矩阵","frequency":1.4623744168,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":89861,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.42980683518673135,"acs":106559,"articleLive":2,"columnArticles":960,"formTitle":"[567]字符串的排列","frequency":2.6440332846,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":247923,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.4930939226519337,"acs":1071,"articleLive":2,"columnArticles":24,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"","submitted":2172,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5637816077494024,"acs":8963,"articleLive":2,"columnArticles":149,"formTitle":"[569]员工薪水中位数","frequency":1.229022426,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"","submitted":15898,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6644142865254671,"acs":11701,"articleLive":2,"columnArticles":105,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.8353654542,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"","submitted":17611,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.48969555035128803,"acs":6273,"articleLive":2,"columnArticles":95,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.8353654542,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"","submitted":12810,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.4739860911532702,"acs":78175,"articleLive":2,"columnArticles":687,"formTitle":"[572]另一棵树的子树","frequency":2.5148736074,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":164931,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6601218686526743,"acs":975,"articleLive":2,"columnArticles":29,"formTitle":"[573]松鼠模拟","frequency":0.6492521472,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"","submitted":1477,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6474252029807586,"acs":11642,"articleLive":2,"columnArticles":108,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"","submitted":17982,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6845934185477291,"acs":40276,"articleLive":2,"columnArticles":402,"formTitle":"[575]分糖果","frequency":1.4623744168,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":58832,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.46915713905876094,"acs":24703,"articleLive":2,"columnArticles":272,"formTitle":"[576]出界的路径数","frequency":1.2623366327,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":52654,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7068395495402418,"acs":13683,"articleLive":2,"columnArticles":78,"formTitle":"[577]员工奖金","frequency":0.8353654542,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"","submitted":19358,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.49873612484888447,"acs":9076,"articleLive":2,"columnArticles":106,"formTitle":"[578]查询回答率最高的问题","frequency":0.2768834642,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"","submitted":18198,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.41422740524781343,"acs":7104,"articleLive":2,"columnArticles":122,"formTitle":"[579]查询员工的累计薪水","frequency":0.8353654542,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"","submitted":17150,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5266981893668551,"acs":9134,"articleLive":2,"columnArticles":74,"formTitle":"[580]统计各专业学生人数","frequency":0.8058212079,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"","submitted":17342,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.4035237125225742,"acs":94293,"articleLive":2,"columnArticles":823,"formTitle":"[581]最短无序连续子数组","frequency":1.5519009431,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":233674,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.402379690736548,"acs":8353,"articleLive":2,"columnArticles":128,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"","submitted":20759,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.5808242626404494,"acs":26467,"articleLive":2,"columnArticles":253,"formTitle":"[583]两个字符串的删除操作","frequency":1.8688514683,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":45568,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7725185230543139,"acs":12616,"articleLive":2,"columnArticles":54,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"","submitted":16331,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5937620331151329,"acs":7710,"articleLive":2,"columnArticles":91,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"","submitted":12985,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7491640691413999,"acs":13219,"articleLive":2,"columnArticles":83,"formTitle":"[586]订单最多的客户","frequency":1.1969752486,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"","submitted":17645,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.3790987535953979,"acs":1977,"articleLive":2,"columnArticles":36,"formTitle":"[587]安装栅栏","frequency":0.6036237946,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5215,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.43302280758111145,"acs":1348,"articleLive":2,"columnArticles":28,"formTitle":"[588]设计内存文件系统","frequency":0.3938048023,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"","submitted":3113,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7446998476917421,"acs":85076,"articleLive":2,"columnArticles":547,"formTitle":"[589]N 叉树的前序遍历","frequency":1.9133230025,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":114242,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7594893595549557,"acs":60207,"articleLive":2,"columnArticles":441,"formTitle":"[590]N 叉树的后序遍历","frequency":0.8058212079,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":79273,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.3388756927949327,"acs":1712,"articleLive":2,"columnArticles":40,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5052,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5203011230408491,"acs":4216,"articleLive":2,"columnArticles":102,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8103,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.4406437503504738,"acs":7858,"articleLive":2,"columnArticles":123,"formTitle":"[593]有效的正方形","frequency":1.1969752486,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":17833,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5157334133443349,"acs":27502,"articleLive":2,"columnArticles":258,"formTitle":"[594]最长和谐子序列","frequency":0.2255770086,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":53326,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.796228332674609,"acs":98714,"articleLive":2,"columnArticles":229,"formTitle":"[595]大的国家","frequency":1.9286395831,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":123977,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.4202699461416018,"acs":77096,"articleLive":2,"columnArticles":269,"formTitle":"[596]超过5名学生的课","frequency":1.1661086006,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":183444,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.44081309151941817,"acs":9455,"articleLive":2,"columnArticles":78,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.8353654542,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"","submitted":21449,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5166214382632293,"acs":15230,"articleLive":2,"columnArticles":192,"formTitle":"[598]范围求和 II","frequency":0.2768834642,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":29480,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5221397638170823,"acs":27369,"articleLive":2,"columnArticles":254,"formTitle":"[599]两个列表的最小索引总和","frequency":0.8660803995,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":52417,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.3431858407079646,"acs":3878,"articleLive":2,"columnArticles":67,"formTitle":"[600]不含连续1的非负整数","frequency":0.8058212079,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"","submitted":11300,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.4966907240496225,"acs":29868,"articleLive":2,"columnArticles":353,"formTitle":"[601]体育馆的人流量","frequency":2.6656476758,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":60134,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6278481012658228,"acs":7440,"articleLive":2,"columnArticles":81,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":0.3327171103,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"","submitted":11850,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6726955510322769,"acs":11567,"articleLive":2,"columnArticles":104,"formTitle":"[603]连续空余座位","frequency":1.2623366327,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"","submitted":17195,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37282626361124654,"acs":2294,"articleLive":2,"columnArticles":50,"formTitle":"[604]迭代压缩字符串","frequency":0.3625522588,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"","submitted":6153,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.3350735643094447,"acs":104488,"articleLive":2,"columnArticles":1215,"formTitle":"[605]种花问题","frequency":2.667902519,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":311836,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5674013752414983,"acs":27313,"articleLive":2,"columnArticles":298,"formTitle":"[606]根据二叉树创建字符串","frequency":1.1363444987,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":48137,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6646827758600167,"acs":11168,"articleLive":2,"columnArticles":82,"formTitle":"[607]销售员","frequency":0.2768834642,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"","submitted":16802,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6587509349289454,"acs":7046,"articleLive":2,"columnArticles":90,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"","submitted":10696,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.48035714285714287,"acs":6187,"articleLive":2,"columnArticles":95,"formTitle":"[609]在系统中查找重复文件","frequency":0.3327171103,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":12880,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6687108013937282,"acs":9596,"articleLive":2,"columnArticles":69,"formTitle":"[610]判断三角形","frequency":0.2768834642,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"","submitted":14350,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5319104043354174,"acs":47898,"articleLive":2,"columnArticles":374,"formTitle":"[611]有效三角形的个数","frequency":2.44904159,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":90049,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6697779524464531,"acs":6817,"articleLive":2,"columnArticles":58,"formTitle":"[612]平面上的最近距离","frequency":0.0,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"","submitted":10178,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8171766131475311,"acs":10790,"articleLive":2,"columnArticles":79,"formTitle":"[613]直线上的最近距离","frequency":0.2768834642,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"","submitted":13204,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.34690750371471024,"acs":7471,"articleLive":2,"columnArticles":60,"formTitle":"[614]二级关注者","frequency":0.8353654542,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"","submitted":21536,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.4239951384668808,"acs":4884,"articleLive":2,"columnArticles":82,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.3625522588,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"","submitted":11519,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.4610649430594029,"acs":2996,"articleLive":2,"columnArticles":52,"formTitle":"[616]给字符串添加加粗标签","frequency":1.8450487545,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"","submitted":6498,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.788110142200673,"acs":174248,"articleLive":2,"columnArticles":1142,"formTitle":"[617]合并二叉树","frequency":3.0912673184,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":221096,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6203271028037384,"acs":4248,"articleLive":2,"columnArticles":44,"formTitle":"[618]学生地理信息报告","frequency":1.4951320132,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"","submitted":6848,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.46586666666666665,"acs":10482,"articleLive":2,"columnArticles":77,"formTitle":"[619]只出现一次的最大数字","frequency":0.2768834642,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"","submitted":22500,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7723523646802717,"acs":89053,"articleLive":2,"columnArticles":298,"formTitle":"[620]有趣的电影","frequency":1.9286395831,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":115301,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5682741213813147,"acs":74299,"articleLive":2,"columnArticles":477,"formTitle":"[621]任务调度器","frequency":2.9192532337,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":130745,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.43594916994088706,"acs":61580,"articleLive":2,"columnArticles":397,"formTitle":"[622]设计循环队列","frequency":2.5491509264,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":141255,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5452191028695742,"acs":10526,"articleLive":2,"columnArticles":178,"formTitle":"[623]在二叉树中增加一行","frequency":0.2507039587,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":19306,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.41561014263074486,"acs":2098,"articleLive":2,"columnArticles":45,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"","submitted":5048,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.33962264150943394,"acs":2412,"articleLive":2,"columnArticles":50,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"","submitted":7102,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6830333741044906,"acs":42999,"articleLive":2,"columnArticles":330,"formTitle":"[626]换座位","frequency":2.0568559182,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":62953,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8065785052086422,"acs":81608,"articleLive":2,"columnArticles":317,"formTitle":"[627]变更性别","frequency":1.4003342134,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":101178,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5251313793477083,"acs":77543,"articleLive":2,"columnArticles":735,"formTitle":"[628]三个数的最大乘积","frequency":1.6089881446,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":147664,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.40111076828139464,"acs":3900,"articleLive":2,"columnArticles":54,"formTitle":"[629]K个逆序对数组","frequency":1.2623366327,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":9723,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.3644010142865978,"acs":5892,"articleLive":2,"columnArticles":71,"formTitle":"[630]课程表 III","frequency":0.3327171103,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":16169,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.28187361419068735,"acs":1017,"articleLive":2,"columnArticles":32,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"","submitted":3608,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5970950732701452,"acs":18458,"articleLive":2,"columnArticles":232,"formTitle":"[632]最小区间","frequency":0.8660803995,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":30913,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.3996874766814589,"acs":91058,"articleLive":2,"columnArticles":736,"formTitle":"[633]平方数之和","frequency":2.9505096849,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":227823,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.437187604131956,"acs":1312,"articleLive":2,"columnArticles":18,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"","submitted":3001,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5546594982078853,"acs":3714,"articleLive":2,"columnArticles":61,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"","submitted":6696,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.546339449000059,"acs":9261,"articleLive":2,"columnArticles":108,"formTitle":"[636]函数的独占时间","frequency":0.8353654542,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":16951,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6890430603464982,"acs":71112,"articleLive":2,"columnArticles":624,"formTitle":"[637]二叉树的层平均值","frequency":1.0529937962,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":103204,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5939180016291067,"acs":10937,"articleLive":2,"columnArticles":111,"formTitle":"[638]大礼包","frequency":0.8980524322,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":18415,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.31021619975639464,"acs":4075,"articleLive":2,"columnArticles":78,"formTitle":"[639]解码方法 II","frequency":1.2623366327,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"","submitted":13136,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.42333319707313083,"acs":10356,"articleLive":2,"columnArticles":198,"formTitle":"[640]求解方程","frequency":1.229022426,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":24463,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5333333333333333,"acs":20408,"articleLive":2,"columnArticles":229,"formTitle":"[641]设计循环双端队列","frequency":1.3709030133,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":38265,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.4906562364189483,"acs":2258,"articleLive":2,"columnArticles":50,"formTitle":"[642]设计搜索自动补全系统","frequency":0.4265946251,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"","submitted":4602,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.4521831594337742,"acs":61236,"articleLive":2,"columnArticles":559,"formTitle":"[643]子数组最大平均数 I","frequency":1.8127357656,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":135423,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4,"acs":1084,"articleLive":2,"columnArticles":22,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"","submitted":2710,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.43592031705204587,"acs":66436,"articleLive":2,"columnArticles":681,"formTitle":"[645]错误的集合","frequency":2.0568559182,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":152404,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5742125226760486,"acs":20891,"articleLive":2,"columnArticles":177,"formTitle":"[646]最长数对链","frequency":0.7773697867,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":36382,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6555864026861706,"acs":115001,"articleLive":2,"columnArticles":870,"formTitle":"[647]回文子串","frequency":2.9697588164,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":175417,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5810795023073778,"acs":19895,"articleLive":2,"columnArticles":255,"formTitle":"[648]单词替换","frequency":0.2507039587,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":34238,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.4812109789138886,"acs":28595,"articleLive":2,"columnArticles":302,"formTitle":"[649]Dota2 参议院","frequency":0.2507039587,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":59423,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5343155773832011,"acs":25458,"articleLive":2,"columnArticles":296,"formTitle":"[650]只有两个键的键盘","frequency":1.1969752486,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"","submitted":47646,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5803832413121143,"acs":3574,"articleLive":2,"columnArticles":59,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"","submitted":6158,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5709603033941265,"acs":29960,"articleLive":2,"columnArticles":215,"formTitle":"[652]寻找重复的子树","frequency":2.7000389606,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"","submitted":52473,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5934960632406078,"acs":37614,"articleLive":2,"columnArticles":356,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":63377,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8096981327035205,"acs":54853,"articleLive":2,"columnArticles":559,"formTitle":"[654]最大二叉树","frequency":2.1830428583,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":67745,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5951337562953758,"acs":9099,"articleLive":2,"columnArticles":132,"formTitle":"[655]输出二叉树","frequency":0.8660803995,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":15289,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.3066001534919417,"acs":799,"articleLive":2,"columnArticles":24,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"","submitted":2606,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7831611620350163,"acs":80740,"articleLive":2,"columnArticles":607,"formTitle":"[657]机器人能否返回原点","frequency":0.8660803995,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":103095,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.4528522814592557,"acs":24752,"articleLive":2,"columnArticles":224,"formTitle":"[658]找到 K 个最接近的元素","frequency":1.6719059297,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":54658,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.542257371607108,"acs":27769,"articleLive":2,"columnArticles":258,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":51210,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6467661691542289,"acs":650,"articleLive":2,"columnArticles":20,"formTitle":"[660]移除 9","frequency":0.6492521472,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"","submitted":1005,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5596388293574114,"acs":15929,"articleLive":2,"columnArticles":203,"formTitle":"[661]图片平滑器","frequency":0.2768834642,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":28463,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4056952259230973,"acs":26029,"articleLive":2,"columnArticles":251,"formTitle":"[662]二叉树最大宽度","frequency":2.7906806785,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":64159,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.4649025069637883,"acs":1669,"articleLive":2,"columnArticles":33,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"","submitted":3590,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6557535487768046,"acs":21712,"articleLive":2,"columnArticles":187,"formTitle":"[664]奇怪的打印机","frequency":2.7357060793,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":33110,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2698564451460376,"acs":72824,"articleLive":2,"columnArticles":914,"formTitle":"[665]非递减数列","frequency":2.4067736718,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":269862,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6185988061577129,"acs":1969,"articleLive":2,"columnArticles":74,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"","submitted":3183,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6239102357119793,"acs":7729,"articleLive":2,"columnArticles":115,"formTitle":"[667]优美的排列 II","frequency":0.7773697867,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":12388,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5072813643797212,"acs":6514,"articleLive":2,"columnArticles":63,"formTitle":"[668]乘法表中第k小的数","frequency":1.6719059297,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":12841,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6671414159397069,"acs":33726,"articleLive":2,"columnArticles":286,"formTitle":"[669]修剪二叉搜索树","frequency":0.8353654542,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":50553,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.4491818631149034,"acs":17267,"articleLive":2,"columnArticles":265,"formTitle":"[670]最大交换","frequency":3.0733173822,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":38441,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.4867052347262073,"acs":52076,"articleLive":2,"columnArticles":653,"formTitle":"[671]二叉树中第二小的节点","frequency":1.0636299313,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":106997,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5524206476434754,"acs":3446,"articleLive":2,"columnArticles":37,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.2507039587,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":6238,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.3895420748091386,"acs":27400,"articleLive":2,"columnArticles":255,"formTitle":"[673]最长递增子序列的个数","frequency":2.3372602337,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":70339,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.48982078000079327,"acs":86447,"articleLive":2,"columnArticles":733,"formTitle":"[674]最长连续递增序列","frequency":1.6939017577,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":176487,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.4004041570438799,"acs":2774,"articleLive":2,"columnArticles":46,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":6928,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5854818065459865,"acs":6404,"articleLive":2,"columnArticles":114,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":10938,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6151894303963601,"acs":14062,"articleLive":2,"columnArticles":230,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":22858,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.3508723725786509,"acs":17878,"articleLive":2,"columnArticles":218,"formTitle":"[678]有效的括号字符串","frequency":3.5516846539,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"","submitted":50953,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5410007403213866,"acs":24846,"articleLive":2,"columnArticles":255,"formTitle":"[679]24 点游戏","frequency":3.3150479368,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":45926,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.40155913167460666,"acs":82520,"articleLive":2,"columnArticles":784,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":2.7854150142,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":205499,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5002049180327869,"acs":2441,"articleLive":2,"columnArticles":58,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"","submitted":4880,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6953050542926333,"acs":44503,"articleLive":2,"columnArticles":495,"formTitle":"[682]棒球比赛","frequency":1.4308011549,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":64005,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4275377299979326,"acs":2068,"articleLive":2,"columnArticles":47,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"","submitted":4837,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6662508091567115,"acs":56608,"articleLive":2,"columnArticles":584,"formTitle":"[684]冗余连接","frequency":1.4308011549,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":84965,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.4342829142258948,"acs":19498,"articleLive":2,"columnArticles":252,"formTitle":"[685]冗余连接 II","frequency":1.4623744168,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":44897,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.3543589417181168,"acs":16702,"articleLive":2,"columnArticles":187,"formTitle":"[686]重复叠加字符串匹配","frequency":0.3041926436,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":47133,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.4391806457051336,"acs":36470,"articleLive":2,"columnArticles":260,"formTitle":"[687]最长同值路径","frequency":2.3713792637,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":83041,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5095431269535147,"acs":7662,"articleLive":2,"columnArticles":102,"formTitle":"[688]“马”在棋盘上的概率","frequency":0.2768834642,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":15037,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.48514222151597014,"acs":3053,"articleLive":2,"columnArticles":65,"formTitle":"[689]三个无重叠子数组的最大和","frequency":1.7395770104,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6293,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6462813248298916,"acs":54519,"articleLive":2,"columnArticles":555,"formTitle":"[690]员工的重要性","frequency":3.1961524268,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"ac","submitted":84358,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.48853847276974743,"acs":3346,"articleLive":2,"columnArticles":44,"formTitle":"[691]贴纸拼词","frequency":0.0,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":6849,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5809292493140826,"acs":64579,"articleLive":2,"columnArticles":708,"formTitle":"[692]前K个高频单词","frequency":3.0989466681,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":111165,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6090519017720782,"acs":25124,"articleLive":2,"columnArticles":269,"formTitle":"[693]交替位二进制数","frequency":0.2255770086,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":41251,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5284195605953225,"acs":3728,"articleLive":2,"columnArticles":70,"formTitle":"[694]不同岛屿的数量","frequency":0.8660803995,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"","submitted":7055,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6621557113525389,"acs":115131,"articleLive":2,"columnArticles":1151,"formTitle":"[695]岛屿的最大面积","frequency":3.1930599597,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":173873,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6301448695173518,"acs":50370,"articleLive":2,"columnArticles":460,"formTitle":"[696]计数二进制子串","frequency":0.8058212079,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":79934,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.605978387550931,"acs":64993,"articleLive":2,"columnArticles":824,"formTitle":"[697]数组的度","frequency":1.6398929527,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":107253,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.4404035084832228,"acs":26762,"articleLive":2,"columnArticles":201,"formTitle":"[698]划分为k个相等的子集","frequency":2.8311163642,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":60767,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47265336289726534,"acs":2558,"articleLive":2,"columnArticles":37,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5412,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7587586870413395,"acs":74133,"articleLive":2,"columnArticles":466,"formTitle":"[700]二叉搜索树中的搜索","frequency":1.3148973373,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":97703,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7241236214999326,"acs":69799,"articleLive":2,"columnArticles":520,"formTitle":"[701]二叉搜索树中的插入操作","frequency":1.4184857283,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":96391,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7381564450973191,"acs":4020,"articleLive":2,"columnArticles":74,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"","submitted":5446,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.511767611721741,"acs":58015,"articleLive":2,"columnArticles":527,"formTitle":"[703]数据流中的第 K 大元素","frequency":1.5222486422,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":113362,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5550193129016716,"acs":203898,"articleLive":2,"columnArticles":997,"formTitle":"[704]二分查找","frequency":3.9053683104,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":367371,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6473144605967865,"acs":63453,"articleLive":2,"columnArticles":417,"formTitle":"[705]设计哈希集合","frequency":2.6656476758,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":98025,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6447549435957556,"acs":53897,"articleLive":2,"columnArticles":374,"formTitle":"[706]设计哈希映射","frequency":2.1101109672,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":83593,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3174234295340446,"acs":57094,"articleLive":2,"columnArticles":402,"formTitle":"[707]设计链表","frequency":2.8562159835,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":179867,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.33657491346629304,"acs":2042,"articleLive":2,"columnArticles":48,"formTitle":"[708]循环有序列表的插入","frequency":0.3625522588,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"","submitted":6067,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7596620075960728,"acs":69405,"articleLive":2,"columnArticles":493,"formTitle":"[709]转换成小写字母","frequency":0.2768834642,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":91363,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3505338078291815,"acs":4728,"articleLive":2,"columnArticles":55,"formTitle":"[710]黑名单中的随机数","frequency":1.229022426,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":13488,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5740897544453852,"acs":678,"articleLive":2,"columnArticles":24,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"","submitted":1181,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6712782821732238,"acs":13974,"articleLive":2,"columnArticles":147,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":1.8127357656,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":20817,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.40276550718086745,"acs":19603,"articleLive":2,"columnArticles":177,"formTitle":"[713]乘积小于K的子数组","frequency":2.0534117956,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":48671,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7166538255002218,"acs":92085,"articleLive":2,"columnArticles":629,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":2.0756782318,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":128493,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.40266756711126117,"acs":2385,"articleLive":2,"columnArticles":40,"formTitle":"[715]Range 模块","frequency":0.966163858,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":5923,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.45899772209567197,"acs":3627,"articleLive":2,"columnArticles":67,"formTitle":"[716]最大栈","frequency":0.2768834642,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"ac","submitted":7902,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5101730994538044,"acs":30917,"articleLive":2,"columnArticles":370,"formTitle":"[717]1比特与2比特字符","frequency":0.8353654542,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":60601,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5638110734860812,"acs":76923,"articleLive":2,"columnArticles":553,"formTitle":"[718]最长重复子数组","frequency":3.3519044821,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":136434,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3664767747589833,"acs":8363,"articleLive":2,"columnArticles":78,"formTitle":"[719]找出第 k 小的距离对","frequency":0.8353654542,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":22820,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.4862234124736056,"acs":18882,"articleLive":2,"columnArticles":247,"formTitle":"[720]词典中最长的单词","frequency":0.1425667653,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":38834,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.4695422564633922,"acs":28096,"articleLive":2,"columnArticles":328,"formTitle":"[721]账户合并","frequency":2.2022005323,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":59837,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.3216816249409542,"acs":4767,"articleLive":2,"columnArticles":72,"formTitle":"[722]删除注释","frequency":1.6398929527,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":14819,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7254437869822485,"acs":1226,"articleLive":2,"columnArticles":38,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"","submitted":1690,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.4559709987565892,"acs":130182,"articleLive":2,"columnArticles":818,"formTitle":"[724]寻找数组的中心下标","frequency":1.2623366327,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":285505,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.5626719436266229,"acs":23316,"articleLive":2,"columnArticles":304,"formTitle":"[725]分隔链表","frequency":1.1969752486,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":41438,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5556767708252163,"acs":21393,"articleLive":2,"columnArticles":388,"formTitle":"[726]原子的数量","frequency":2.5491509264,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":38499,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.41295483061480553,"acs":2633,"articleLive":2,"columnArticles":43,"formTitle":"[727]最小窗口子序列","frequency":1.4951320132,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"","submitted":6376,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7588967157625103,"acs":33182,"articleLive":2,"columnArticles":298,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":43724,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5056024346382626,"acs":7310,"articleLive":2,"columnArticles":82,"formTitle":"[729]我的日程安排表 I","frequency":1.1661086006,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":14458,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.48770385710587627,"acs":3768,"articleLive":2,"columnArticles":47,"formTitle":"[730]统计不同回文子序列","frequency":2.0263098659,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":7726,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5102965403624382,"acs":3717,"articleLive":2,"columnArticles":37,"formTitle":"[731]我的日程安排表 II","frequency":0.2768834642,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":7284,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6116352201257862,"acs":3112,"articleLive":2,"columnArticles":49,"formTitle":"[732]我的日程安排表 III","frequency":0.3938048023,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5088,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5804734146267541,"acs":57457,"articleLive":2,"columnArticles":489,"formTitle":"[733]图像渲染","frequency":1.898257939,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":98983,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4784892446223112,"acs":1913,"articleLive":2,"columnArticles":34,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"","submitted":3998,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.40999427903390295,"acs":16483,"articleLive":2,"columnArticles":210,"formTitle":"[735]行星碰撞","frequency":1.4623744168,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":40203,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.45850046282011725,"acs":1486,"articleLive":2,"columnArticles":44,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3241,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4626865671641791,"acs":3627,"articleLive":2,"columnArticles":60,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"","submitted":7839,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5018986212696552,"acs":39388,"articleLive":2,"columnArticles":568,"formTitle":"[738]单调递增的数字","frequency":1.5291604751,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"","submitted":78478,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6775673413719352,"acs":196731,"articleLive":2,"columnArticles":1425,"formTitle":"[739]每日温度","frequency":4.2877261458,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":290349,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6311124998224659,"acs":44436,"articleLive":2,"columnArticles":525,"formTitle":"[740]删除并获得点数","frequency":2.9248617734,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":70409,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.36507324595219737,"acs":3788,"articleLive":2,"columnArticles":43,"formTitle":"[741]摘樱桃","frequency":1.3709030133,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":10376,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4928813559322034,"acs":1454,"articleLive":2,"columnArticles":42,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"","submitted":2950,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5154131065297484,"acs":52601,"articleLive":2,"columnArticles":492,"formTitle":"[743]网络延迟时间","frequency":1.3445995505,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":102056,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.45932036097010714,"acs":39090,"articleLive":2,"columnArticles":346,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":1.4308011549,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":85104,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.390742890307603,"acs":2693,"articleLive":2,"columnArticles":51,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":6892,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5789443217011259,"acs":120014,"articleLive":2,"columnArticles":1187,"formTitle":"[746]使用最小花费爬楼梯","frequency":2.2558121444,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":207298,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.414522333432925,"acs":44397,"articleLive":2,"columnArticles":393,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.2768834642,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":107104,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.5983975963945919,"acs":11950,"articleLive":2,"columnArticles":165,"formTitle":"[748]最短补全词","frequency":0.2507039587,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":19970,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5064516129032258,"acs":1256,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.9313777419,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2480,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7230354391371341,"acs":1877,"articleLive":2,"columnArticles":42,"formTitle":"[750]角矩形的数量","frequency":1.2128460785,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"","submitted":2596,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5083674228337672,"acs":1367,"articleLive":2,"columnArticles":27,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"","submitted":2689,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5319073314162008,"acs":65848,"articleLive":2,"columnArticles":560,"formTitle":"[752]打开转盘锁","frequency":1.9925912299,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":123796,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5871329211746522,"acs":3039,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":1.0018055493,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5176,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.42744400600233423,"acs":7691,"articleLive":2,"columnArticles":87,"formTitle":"[754]到达终点数字","frequency":0.8353654542,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":17993,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.5014061872237846,"acs":1248,"articleLive":2,"columnArticles":30,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"","submitted":2489,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.574025634318598,"acs":4389,"articleLive":2,"columnArticles":66,"formTitle":"[756]金字塔转换矩阵","frequency":0.3041926436,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":7646,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.41613475177304965,"acs":2347,"articleLive":2,"columnArticles":36,"formTitle":"[757]设置交集大小至少为2","frequency":0.4265946251,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5640,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.45853397538790797,"acs":3428,"articleLive":2,"columnArticles":68,"formTitle":"[758]字符串中的加粗单词","frequency":0.6492521472,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"","submitted":7476,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6577540106951871,"acs":1722,"articleLive":2,"columnArticles":44,"formTitle":"[759]员工空闲时间","frequency":0.3625522588,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"","submitted":2618,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8382642998027613,"acs":3825,"articleLive":2,"columnArticles":87,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"","submitted":4563,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5940333430827728,"acs":2031,"articleLive":2,"columnArticles":33,"formTitle":"[761]特殊的二进制序列","frequency":0.6036237946,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3419,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.6976331599532277,"acs":17302,"articleLive":2,"columnArticles":136,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":24801,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7627106776694174,"acs":76252,"articleLive":2,"columnArticles":925,"formTitle":"[763]划分字母区间","frequency":3.1181116855,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":99975,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.49054020413243715,"acs":3941,"articleLive":2,"columnArticles":51,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8034,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6655749293119698,"acs":28247,"articleLive":2,"columnArticles":424,"formTitle":"[765]情侣牵手","frequency":2.7966391064,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":42440,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7081391695900309,"acs":54099,"articleLive":2,"columnArticles":627,"formTitle":"[766]托普利茨矩阵","frequency":0.2768834642,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":76396,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.47740386382290606,"acs":38970,"articleLive":2,"columnArticles":487,"formTitle":"[767]重构字符串","frequency":2.0976668046,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":81629,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.49989388794567063,"acs":4711,"articleLive":2,"columnArticles":75,"formTitle":"[768]最多能完成排序的块 II","frequency":1.229022426,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":9424,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.590569825500592,"acs":11473,"articleLive":2,"columnArticles":134,"formTitle":"[769]最多能完成排序的块","frequency":0.2768834642,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":19427,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5520428015564203,"acs":1135,"articleLive":2,"columnArticles":25,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2056,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8514173998044966,"acs":150683,"articleLive":2,"columnArticles":1095,"formTitle":"[771]宝石与石头","frequency":2.1704854006,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"","submitted":176979,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4888927912898411,"acs":5568,"articleLive":2,"columnArticles":115,"formTitle":"[772]基本计算器 III","frequency":1.3709030133,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"","submitted":11389,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7159671330224295,"acs":22568,"articleLive":2,"columnArticles":324,"formTitle":"[773]滑动谜题","frequency":2.4996909759,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":31521,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5941348973607038,"acs":1013,"articleLive":2,"columnArticles":21,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"","submitted":1705,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.46147324792765637,"acs":4899,"articleLive":2,"columnArticles":74,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":10616,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5709560039695667,"acs":1726,"articleLive":2,"columnArticles":37,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"","submitted":3023,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.3240380587636886,"acs":5415,"articleLive":2,"columnArticles":58,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":0.8660803995,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":16711,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5985532026831514,"acs":22754,"articleLive":2,"columnArticles":342,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.3327171103,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":38015,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4354234853657962,"acs":18492,"articleLive":2,"columnArticles":227,"formTitle":"[779]第K个语法符号","frequency":1.8450487545,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":42469,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2839974114819266,"acs":3072,"articleLive":2,"columnArticles":48,"formTitle":"[780]到达终点","frequency":0.966163858,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":10817,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6236098972303427,"acs":41384,"articleLive":2,"columnArticles":637,"formTitle":"[781]森林中的兔子","frequency":4.3697904428,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":66362,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.42159853569249545,"acs":1382,"articleLive":2,"columnArticles":28,"formTitle":"[782]变为棋盘","frequency":1.6939017577,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3278,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5957487669678321,"acs":68246,"articleLive":2,"columnArticles":659,"formTitle":"[783]二叉搜索树节点最小距离","frequency":1.6719059297,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":114555,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6839114010989011,"acs":39831,"articleLive":2,"columnArticles":430,"formTitle":"[784]字母大小写全排列","frequency":1.1661086006,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"","submitted":58240,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.511202657807309,"acs":38468,"articleLive":2,"columnArticles":395,"formTitle":"[785]判断二分图","frequency":2.0263098659,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":75250,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.45959357277882795,"acs":3890,"articleLive":2,"columnArticles":50,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":8464,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.3530575931440192,"acs":19445,"articleLive":2,"columnArticles":191,"formTitle":"[787]K 站中转内最便宜的航班","frequency":1.8450487545,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"","submitted":55076,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6067133429365851,"acs":18111,"articleLive":2,"columnArticles":181,"formTitle":"[788]旋转数字","frequency":0.8980524322,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":29851,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6930187736455136,"acs":19417,"articleLive":2,"columnArticles":277,"formTitle":"[789]逃脱阻碍者","frequency":1.1035882436,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":28018,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.44741337237676915,"acs":3667,"articleLive":2,"columnArticles":59,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8196,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6947455681673256,"acs":10895,"articleLive":2,"columnArticles":192,"formTitle":"[791]自定义字符串排序","frequency":1.7051051014,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":15682,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.45031004774186467,"acs":8206,"articleLive":2,"columnArticles":92,"formTitle":"[792]匹配子序列的单词数","frequency":0.8353654542,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":18223,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.39390396659707727,"acs":4717,"articleLive":2,"columnArticles":64,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.2507039587,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":11975,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3409276616198029,"acs":7093,"articleLive":2,"columnArticles":96,"formTitle":"[794]有效的井字游戏","frequency":0.3041926436,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":20805,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5341225130143336,"acs":7490,"articleLive":2,"columnArticles":83,"formTitle":"[795]区间子数组个数","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":14023,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5227191498486978,"acs":21938,"articleLive":2,"columnArticles":259,"formTitle":"[796]旋转字符串","frequency":2.121137653,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":41969,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7406335000438712,"acs":16882,"articleLive":2,"columnArticles":246,"formTitle":"[797]所有可能的路径","frequency":1.1969752486,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":22794,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.4568678267308404,"acs":1234,"articleLive":2,"columnArticles":30,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":2701,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.4069373942470389,"acs":4810,"articleLive":2,"columnArticles":65,"formTitle":"[799]香槟塔","frequency":2.4067736718,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":11820,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7055498458376156,"acs":1373,"articleLive":2,"columnArticles":33,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"","submitted":1946,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.41748925089323563,"acs":6894,"articleLive":2,"columnArticles":82,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.3938048023,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":16513,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5773609413202934,"acs":30226,"articleLive":2,"columnArticles":329,"formTitle":"[802]找到最终的安全状态","frequency":1.2399818402,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":52352,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.4835089969141987,"acs":12065,"articleLive":2,"columnArticles":122,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":24953,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7693555085332331,"acs":38904,"articleLive":2,"columnArticles":387,"formTitle":"[804]唯一摩尔斯密码词","frequency":1.1661086006,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":50567,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.28904237883399675,"acs":2469,"articleLive":2,"columnArticles":39,"formTitle":"[805]数组的均值分割","frequency":1.2623366327,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":8542,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6582408023333163,"acs":12864,"articleLive":2,"columnArticles":143,"formTitle":"[806]写字符串需要的行数","frequency":0.8353654542,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":19543,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8436102236421725,"acs":15843,"articleLive":2,"columnArticles":203,"formTitle":"[807]保持城市天际线","frequency":0.2768834642,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":18780,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4783891094724901,"acs":4217,"articleLive":2,"columnArticles":40,"formTitle":"[808]分汤","frequency":1.2970141712,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":8815,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.41777092031221635,"acs":4603,"articleLive":2,"columnArticles":84,"formTitle":"[809]情感丰富的文字","frequency":0.8660803995,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":11018,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7366998513446552,"acs":16354,"articleLive":2,"columnArticles":132,"formTitle":"[810]黑板异或游戏","frequency":2.0263098659,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":22199,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7026815333579064,"acs":15251,"articleLive":2,"columnArticles":187,"formTitle":"[811]子域名访问计数","frequency":0.8058212079,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":21704,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6294811034147527,"acs":10360,"articleLive":2,"columnArticles":90,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":16458,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5473278606131681,"acs":6534,"articleLive":2,"columnArticles":80,"formTitle":"[813]最大平均值和的分组","frequency":0.3625522588,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":11938,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6998461242546643,"acs":21831,"articleLive":2,"columnArticles":336,"formTitle":"[814]二叉树剪枝","frequency":0.2768834642,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":31194,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4350801920523036,"acs":25554,"articleLive":2,"columnArticles":308,"formTitle":"[815]公交路线","frequency":4.0709765299,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":58734,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.51171875,"acs":3406,"articleLive":2,"columnArticles":59,"formTitle":"[816]模糊坐标","frequency":0.3938048023,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":6656,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5914647900031579,"acs":13111,"articleLive":2,"columnArticles":163,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":22167,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.42934648581997537,"acs":3482,"articleLive":2,"columnArticles":42,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8110,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.42063765530940267,"acs":20753,"articleLive":2,"columnArticles":239,"formTitle":"[819]最常见的单词","frequency":0.9313777419,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":49337,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5055830792682927,"acs":53066,"articleLive":2,"columnArticles":591,"formTitle":"[820]单词的压缩编码","frequency":1.9494671609,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":104960,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6916294345651981,"acs":23375,"articleLive":2,"columnArticles":314,"formTitle":"[821]字符的最短距离","frequency":1.4623744168,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":33797,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5019419271314962,"acs":2714,"articleLive":2,"columnArticles":35,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5407,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.4292721518987342,"acs":2713,"articleLive":2,"columnArticles":52,"formTitle":"[823]带因子的二叉树","frequency":0.532340412,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":6320,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6141640283431328,"acs":16295,"articleLive":2,"columnArticles":232,"formTitle":"[824]山羊拉丁文","frequency":0.2768834642,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":26532,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.3895020694845102,"acs":6211,"articleLive":2,"columnArticles":84,"formTitle":"[825]适龄的朋友","frequency":0.2768834642,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":15946,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.37273390289643676,"acs":7155,"articleLive":2,"columnArticles":103,"formTitle":"[826]安排工作以达到最大收益","frequency":0.3041926436,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":19196,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3933916423712342,"acs":8096,"articleLive":2,"columnArticles":170,"formTitle":"[827]最大人工岛","frequency":1.4951320132,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":20580,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.48695368558382257,"acs":2986,"articleLive":2,"columnArticles":49,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":6132,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.3610801657680139,"acs":8103,"articleLive":2,"columnArticles":94,"formTitle":"[829]连续整数求和","frequency":1.4623744168,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":22441,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5431609432307025,"acs":51389,"articleLive":2,"columnArticles":572,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":94611,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.403341020304854,"acs":7171,"articleLive":2,"columnArticles":68,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":17779,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7954571084880836,"acs":84643,"articleLive":2,"columnArticles":909,"formTitle":"[832]翻转图像","frequency":2.846843668,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":106408,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4247733612273361,"acs":4873,"articleLive":2,"columnArticles":73,"formTitle":"[833]字符串中的查找与替换","frequency":0.2768834642,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":11472,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5291476192402605,"acs":13080,"articleLive":2,"columnArticles":128,"formTitle":"[834]树中距离之和","frequency":0.8980524322,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":24719,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5724989593450812,"acs":4126,"articleLive":2,"columnArticles":46,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7207,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.4771975948147955,"acs":36665,"articleLive":2,"columnArticles":645,"formTitle":"[836]矩形重叠","frequency":0.8353654542,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":76834,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.3968939989246867,"acs":19193,"articleLive":2,"columnArticles":239,"formTitle":"[837]新21点","frequency":0.8660803995,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":48358,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5005929439667951,"acs":6754,"articleLive":2,"columnArticles":118,"formTitle":"[838]推多米诺","frequency":0.0,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":13492,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5742562122744125,"acs":18742,"articleLive":2,"columnArticles":265,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":32637,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.3586492746556138,"acs":8826,"articleLive":2,"columnArticles":111,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":24609,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6563822458419447,"acs":53356,"articleLive":2,"columnArticles":522,"formTitle":"[841]钥匙和房间","frequency":0.8353654542,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":81288,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.48952649181482133,"acs":27810,"articleLive":2,"columnArticles":318,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":2.088441647,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":56810,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3760928765945249,"acs":2624,"articleLive":2,"columnArticles":33,"formTitle":"[843]猜猜这个单词","frequency":0.4610570293,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":6977,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5162748530699012,"acs":82573,"articleLive":2,"columnArticles":919,"formTitle":"[844]比较含退格的字符串","frequency":1.3424434944,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":159940,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.4200930466490633,"acs":36751,"articleLive":2,"columnArticles":546,"formTitle":"[845]数组中的最长山脉","frequency":1.6719059297,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":87483,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5109538461538462,"acs":8303,"articleLive":2,"columnArticles":112,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":16250,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6838760921366164,"acs":18081,"articleLive":2,"columnArticles":155,"formTitle":"[847]访问所有节点的最短路径","frequency":1.5854369908,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":26439,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.4457121825542878,"acs":8477,"articleLive":2,"columnArticles":92,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":19019,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.4255511433657401,"acs":15539,"articleLive":2,"columnArticles":176,"formTitle":"[849]到最近的人的最大距离","frequency":0.3625522588,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":36515,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4416814683244523,"acs":2238,"articleLive":2,"columnArticles":40,"formTitle":"[850]矩形面积 II","frequency":1.4951320132,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5067,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.4821493404332567,"acs":3984,"articleLive":2,"columnArticles":68,"formTitle":"[851]喧闹和富有","frequency":1.1969752486,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":8263,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7153650187783974,"acs":81714,"articleLive":2,"columnArticles":702,"formTitle":"[852]山脉数组的峰顶索引","frequency":2.9124421462,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":114227,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.3812159095433372,"acs":9575,"articleLive":2,"columnArticles":117,"formTitle":"[853]车队","frequency":1.7754180025,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":25117,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.36102590320381733,"acs":4237,"articleLive":2,"columnArticles":63,"formTitle":"[854]相似度为 K 的字符串","frequency":0.3938048023,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":11736,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.40796586059743956,"acs":4302,"articleLive":2,"columnArticles":51,"formTitle":"[855]考场就座","frequency":0.8353654542,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":10545,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.62497500099996,"acs":15625,"articleLive":2,"columnArticles":212,"formTitle":"[856]括号的分数","frequency":1.8785489841,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":25001,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.46691717039699393,"acs":2858,"articleLive":2,"columnArticles":45,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":1.3331626853,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6121,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5568321707016824,"acs":2714,"articleLive":2,"columnArticles":44,"formTitle":"[858]镜面反射","frequency":1.2623366327,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":4874,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.30144563027922144,"acs":27087,"articleLive":2,"columnArticles":350,"formTitle":"[859]亲密字符串","frequency":0.8353654542,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":89857,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5863472560661701,"acs":85422,"articleLive":2,"columnArticles":747,"formTitle":"[860]柠檬水找零","frequency":1.6398929527,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"","submitted":145685,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8090533267465745,"acs":31117,"articleLive":2,"columnArticles":434,"formTitle":"[861]翻转矩阵后的得分","frequency":0.2768834642,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"","submitted":38461,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.18730458452370735,"acs":15276,"articleLive":2,"columnArticles":122,"formTitle":"[862]和至少为 K 的最短子数组","frequency":2.3043300274,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":81557,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6034525849757212,"acs":33803,"articleLive":2,"columnArticles":548,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":1.4602335926,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":56016,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.4527080372651192,"acs":2867,"articleLive":2,"columnArticles":41,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6333,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6536223005054372,"acs":8535,"articleLive":2,"columnArticles":120,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":13058,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22322552903958967,"acs":7268,"articleLive":2,"columnArticles":82,"formTitle":"[866]回文素数","frequency":0.8660803995,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":32559,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6709724591762125,"acs":82590,"articleLive":2,"columnArticles":741,"formTitle":"[867]转置矩阵","frequency":3.1206394927,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":123090,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6236985816996032,"acs":15875,"articleLive":2,"columnArticles":224,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":25453,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.550075401401579,"acs":6201,"articleLive":2,"columnArticles":87,"formTitle":"[869]重新排序得到 2 的幂","frequency":0.2768834642,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":11273,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.42297658239642216,"acs":13619,"articleLive":2,"columnArticles":174,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":32198,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.33829608083282303,"acs":8839,"articleLive":2,"columnArticles":117,"formTitle":"[871]最低加油次数","frequency":1.8127357656,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":26128,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6521377164828183,"acs":59533,"articleLive":2,"columnArticles":711,"formTitle":"[872]叶子相似的树","frequency":2.667902519,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":91289,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5084788118953268,"acs":14243,"articleLive":2,"columnArticles":101,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":1.6719059297,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":28011,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.4129225234270415,"acs":19741,"articleLive":2,"columnArticles":216,"formTitle":"[874]模拟行走机器人","frequency":1.6719059297,"frontendQuestionId":"874","leaf":true,"level":1,"nodeType":"def","questionId":"906","status":"","submitted":47808,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.47635669356822413,"acs":40668,"articleLive":2,"columnArticles":316,"formTitle":"[875]爱吃香蕉的珂珂","frequency":2.1704854006,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":85373,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7061615131352954,"acs":133622,"articleLive":2,"columnArticles":1511,"formTitle":"[876]链表的中间结点","frequency":2.0263098659,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":189223,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7566769003485607,"acs":65560,"articleLive":2,"columnArticles":471,"formTitle":"[877]石子游戏","frequency":2.8687884398,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":86642,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2792691029900332,"acs":4203,"articleLive":2,"columnArticles":59,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":15050,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5560558307068888,"acs":20995,"articleLive":2,"columnArticles":179,"formTitle":"[879]盈利计划","frequency":3.4841579193,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":37757,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2521259979173898,"acs":5811,"articleLive":2,"columnArticles":72,"formTitle":"[880]索引处的解码字符串","frequency":0.3938048023,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":23048,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.47883699003643965,"acs":18791,"articleLive":2,"columnArticles":180,"formTitle":"[881]救生艇","frequency":1.6398929527,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"","submitted":39243,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4820886460230723,"acs":1588,"articleLive":2,"columnArticles":28,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3294,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6850331647731004,"acs":10431,"articleLive":2,"columnArticles":102,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":15227,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6607513819935917,"acs":18766,"articleLive":2,"columnArticles":240,"formTitle":"[884]两句话中的不常见单词","frequency":0.2507039587,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":28401,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6893724377168086,"acs":4372,"articleLive":2,"columnArticles":65,"formTitle":"[885]螺旋矩阵 III","frequency":1.4951320132,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":6342,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4223671651288578,"acs":7965,"articleLive":2,"columnArticles":105,"formTitle":"[886]可能的二分法","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":18858,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2916065472952196,"acs":49313,"articleLive":2,"columnArticles":322,"formTitle":"[887]鸡蛋掉落","frequency":3.2364967445,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":169108,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6394658042879386,"acs":53389,"articleLive":2,"columnArticles":448,"formTitle":"[888]公平的糖果棒交换","frequency":0.2255770086,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":83490,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6795501795501796,"acs":14382,"articleLive":2,"columnArticles":145,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":2.2725106074,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":21164,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7255817903855953,"acs":8543,"articleLive":2,"columnArticles":118,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":11774,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.3260895665746188,"acs":2716,"articleLive":2,"columnArticles":37,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8329,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6387642958389157,"acs":32897,"articleLive":2,"columnArticles":674,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":51501,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.723812777587974,"acs":10593,"articleLive":2,"columnArticles":101,"formTitle":"[893]特殊等价字符串组","frequency":0.3327171103,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":14635,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7743123772102161,"acs":12612,"articleLive":2,"columnArticles":115,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":16288,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5391787852865697,"acs":6303,"articleLive":2,"columnArticles":74,"formTitle":"[895]最大频率栈","frequency":1.1969752486,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":11690,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5865945967709466,"acs":58277,"articleLive":2,"columnArticles":707,"formTitle":"[896]单调数列","frequency":1.9600604803,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":99348,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7454859918551592,"acs":60775,"articleLive":2,"columnArticles":697,"formTitle":"[897]递增顺序搜索树","frequency":2.8562159835,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":81524,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.33404173106646057,"acs":5187,"articleLive":2,"columnArticles":36,"formTitle":"[898]子数组按位或操作","frequency":1.229022426,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":15528,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5347796610169492,"acs":3944,"articleLive":2,"columnArticles":38,"formTitle":"[899]有序队列","frequency":0.3327171103,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":7375,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.4927312094030312,"acs":3186,"articleLive":2,"columnArticles":39,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":6466,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5405279791782859,"acs":17445,"articleLive":2,"columnArticles":218,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":32274,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.325831096427834,"acs":3156,"articleLive":2,"columnArticles":72,"formTitle":"[902]最大为 N 的数字组合","frequency":0.0,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":9686,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5307335190343547,"acs":2858,"articleLive":2,"columnArticles":41,"formTitle":"[903]DI 序列的有效排列","frequency":0.6978998714,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5385,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.45183199750182157,"acs":17363,"articleLive":2,"columnArticles":241,"formTitle":"[904]水果成篮","frequency":1.6719059297,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":38428,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7015357000398883,"acs":56280,"articleLive":2,"columnArticles":579,"formTitle":"[905]按奇偶排序数组","frequency":1.4623744168,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":80224,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2719621251972646,"acs":2068,"articleLive":2,"columnArticles":34,"formTitle":"[906]超级回文数","frequency":1.9348384624,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":7604,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3151350706661101,"acs":10569,"articleLive":2,"columnArticles":120,"formTitle":"[907]子数组的最小值之和","frequency":1.6719059297,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":33538,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6979377133700272,"acs":20035,"articleLive":2,"columnArticles":179,"formTitle":"[908]最小差值 I","frequency":0.2768834642,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":28706,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.46162299728150846,"acs":15962,"articleLive":2,"columnArticles":191,"formTitle":"[909]蛇梯棋","frequency":1.9870891527,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":34578,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.3169333532725188,"acs":6358,"articleLive":2,"columnArticles":63,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":20061,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.430712008501594,"acs":4053,"articleLive":2,"columnArticles":61,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":9410,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5671833900719562,"acs":202261,"articleLive":2,"columnArticles":985,"formTitle":"[912]排序数组","frequency":4.0324965079,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":356606,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.401910686514108,"acs":1809,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":0.3938048023,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4501,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3889268681084472,"acs":48358,"articleLive":2,"columnArticles":607,"formTitle":"[914]卡牌分组","frequency":0.8353654542,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":124337,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.46786429248761985,"acs":8881,"articleLive":2,"columnArticles":108,"formTitle":"[915]分割数组","frequency":0.8660803995,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":18982,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.43850533807829184,"acs":6161,"articleLive":2,"columnArticles":66,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14050,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5693623670345961,"acs":28422,"articleLive":2,"columnArticles":418,"formTitle":"[917]仅仅反转字母","frequency":1.7395770104,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":49919,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.3583862566820487,"acs":15688,"articleLive":2,"columnArticles":190,"formTitle":"[918]环形子数组的最大和","frequency":1.4308011549,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":43774,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6249208560212739,"acs":4935,"articleLive":2,"columnArticles":89,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":7897,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.47905331882480956,"acs":1761,"articleLive":2,"columnArticles":18,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3676,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7349676565715966,"acs":19997,"articleLive":2,"columnArticles":289,"formTitle":"[921]使括号有效的最少添加","frequency":0.3327171103,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":27208,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7144838262327862,"acs":88616,"articleLive":2,"columnArticles":814,"formTitle":"[922]按奇偶排序数组 II","frequency":0.8353654542,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":124028,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.33808209921729826,"acs":6004,"articleLive":2,"columnArticles":79,"formTitle":"[923]三数之和的多种可能","frequency":0.8660803995,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":17759,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.35962145110410093,"acs":5928,"articleLive":2,"columnArticles":89,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":16484,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.38831572015428517,"acs":49532,"articleLive":2,"columnArticles":665,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":127556,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5146454049517415,"acs":6132,"articleLive":2,"columnArticles":109,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.8660803995,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":11915,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3375240798945554,"acs":3329,"articleLive":2,"columnArticles":65,"formTitle":"[927]三等分","frequency":1.8127357656,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":9863,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.42026117926394935,"acs":2124,"articleLive":2,"columnArticles":40,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5054,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6422554137164711,"acs":24854,"articleLive":2,"columnArticles":224,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":38698,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.544963909674856,"acs":32918,"articleLive":2,"columnArticles":335,"formTitle":"[930]和相同的二元子数组","frequency":2.5599501674,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":60404,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6585800386641901,"acs":17374,"articleLive":2,"columnArticles":216,"formTitle":"[931]下降路径最小和","frequency":1.1363444987,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":26381,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6266169351638758,"acs":7896,"articleLive":2,"columnArticles":74,"formTitle":"[932]漂亮数组","frequency":0.8353654542,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":12601,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7233052018451989,"acs":34025,"articleLive":2,"columnArticles":291,"formTitle":"[933]最近的请求次数","frequency":1.6719059297,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":47041,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.4752406691831766,"acs":21277,"articleLive":2,"columnArticles":244,"formTitle":"[934]最短的桥","frequency":2.1901811569,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":44771,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4748213125406108,"acs":5846,"articleLive":2,"columnArticles":78,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":12312,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.3788109756097561,"acs":1491,"articleLive":2,"columnArticles":24,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":3936,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5883144439269264,"acs":11368,"articleLive":2,"columnArticles":119,"formTitle":"[937]重新排列日志文件","frequency":0.8353654542,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":19323,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8181082500408929,"acs":95029,"articleLive":2,"columnArticles":780,"formTitle":"[938]二叉搜索树的范围和","frequency":2.4642102497,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":116157,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4501145778247841,"acs":5107,"articleLive":2,"columnArticles":59,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":11346,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.41190972880713067,"acs":4344,"articleLive":2,"columnArticles":53,"formTitle":"[940]不同的子序列 II","frequency":0.2768834642,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"","submitted":10546,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3926390248930578,"acs":60947,"articleLive":2,"columnArticles":602,"formTitle":"[941]有效的山脉数组","frequency":0.2507039587,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":155224,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7288062283737025,"acs":21905,"articleLive":2,"columnArticles":201,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":30056,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.4735143855875235,"acs":1761,"articleLive":2,"columnArticles":41,"formTitle":"[943]最短超级串","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":3719,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6902925531914894,"acs":20764,"articleLive":2,"columnArticles":173,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":30080,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.4869761228919686,"acs":34998,"articleLive":2,"columnArticles":533,"formTitle":"[945]使数组唯一的最小增量","frequency":1.4623744168,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":71868,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6215149034525931,"acs":25814,"articleLive":2,"columnArticles":285,"formTitle":"[946]验证栈序列","frequency":2.3969888579,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":41534,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6129397317666322,"acs":25456,"articleLive":2,"columnArticles":331,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":41531,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.3913690476190476,"acs":6575,"articleLive":2,"columnArticles":93,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":16800,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.36954511834319526,"acs":7994,"articleLive":2,"columnArticles":115,"formTitle":"[949]给定数字能组成的最大时间","frequency":1.6719059297,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":21632,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7746779355050464,"acs":9441,"articleLive":2,"columnArticles":136,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.8353654542,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":12187,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6614985444880395,"acs":10453,"articleLive":2,"columnArticles":159,"formTitle":"[951]翻转等价二叉树","frequency":1.4308011549,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":15802,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3481884057971015,"acs":2883,"articleLive":2,"columnArticles":52,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":8280,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5527363605557438,"acs":13049,"articleLive":2,"columnArticles":154,"formTitle":"[953]验证外星语词典","frequency":1.1969752486,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":23608,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.2988369541364933,"acs":6809,"articleLive":2,"columnArticles":100,"formTitle":"[954]二倍数对数组","frequency":1.4623744168,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":22785,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3299839657936932,"acs":3087,"articleLive":2,"columnArticles":47,"formTitle":"[955]删列造序 II","frequency":0.3041926436,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":9355,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.4350028137310073,"acs":3865,"articleLive":2,"columnArticles":49,"formTitle":"[956]最高的广告牌","frequency":1.2970141712,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":8885,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.35957245155855094,"acs":13658,"articleLive":2,"columnArticles":131,"formTitle":"[957]N 天后的牢房","frequency":1.2623366327,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":37984,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5363563578135235,"acs":22107,"articleLive":2,"columnArticles":213,"formTitle":"[958]二叉树的完全性检验","frequency":1.6719059297,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":41217,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7437011962918798,"acs":19334,"articleLive":2,"columnArticles":298,"formTitle":"[959]由斜杠划分区域","frequency":1.1969752486,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":25997,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5522733854619172,"acs":1907,"articleLive":2,"columnArticles":29,"formTitle":"[960]删列造序 III","frequency":0.3938048023,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3453,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6767434329580738,"acs":35527,"articleLive":2,"columnArticles":283,"formTitle":"[961]重复 N 次的元素","frequency":0.8353654542,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":52497,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4412366767840757,"acs":12502,"articleLive":2,"columnArticles":118,"formTitle":"[962]最大宽度坡","frequency":0.0,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":28334,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5025578064252098,"acs":2456,"articleLive":2,"columnArticles":31,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":4887,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.4256488549618321,"acs":1394,"articleLive":2,"columnArticles":24,"formTitle":"[964]表示数字的最少运算符","frequency":1.0018055493,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3275,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6839414011089775,"acs":31700,"articleLive":2,"columnArticles":373,"formTitle":"[965]单值二叉树","frequency":0.2768834642,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":46349,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.40216949152542375,"acs":2966,"articleLive":2,"columnArticles":45,"formTitle":"[966]元音拼写检查器","frequency":0.4966987206,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7375,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.4577747149480015,"acs":7307,"articleLive":2,"columnArticles":139,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":15962,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.49615214320352524,"acs":23532,"articleLive":2,"columnArticles":313,"formTitle":"[968]监控二叉树","frequency":1.7815319859,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":47429,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6521563523762509,"acs":14532,"articleLive":2,"columnArticles":187,"formTitle":"[969]煎饼排序","frequency":0.3041926436,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":22283,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.4144071691176471,"acs":10821,"articleLive":2,"columnArticles":121,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":26112,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.4427991886409736,"acs":6549,"articleLive":2,"columnArticles":99,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.3938048023,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":14790,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.4104180491041805,"acs":1237,"articleLive":2,"columnArticles":26,"formTitle":"[972]相等的有理数","frequency":0.8058212079,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3014,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6383654290404711,"acs":64939,"articleLive":2,"columnArticles":622,"formTitle":"[973]最接近原点的 K 个点","frequency":0.8353654542,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":101727,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.46525928246905845,"acs":35637,"articleLive":2,"columnArticles":372,"formTitle":"[974]和可被 K 整除的子数组","frequency":2.7000389606,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":76596,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.4420846513029071,"acs":2935,"articleLive":2,"columnArticles":43,"formTitle":"[975]奇偶跳","frequency":0.3625522588,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":6639,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5970222196965392,"acs":52529,"articleLive":2,"columnArticles":486,"formTitle":"[976]三角形的最大周长","frequency":1.229022426,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"","submitted":87985,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7179966874201787,"acs":143921,"articleLive":2,"columnArticles":1131,"formTitle":"[977]有序数组的平方","frequency":2.3456753126,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":200448,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.47357110247530815,"acs":42530,"articleLive":2,"columnArticles":590,"formTitle":"[978]最长湍流子数组","frequency":0.8353654542,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":89807,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7122604358099238,"acs":8139,"articleLive":2,"columnArticles":128,"formTitle":"[979]在二叉树中分配硬币","frequency":0.8660803995,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":11427,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7330455894254114,"acs":13587,"articleLive":2,"columnArticles":200,"formTitle":"[980]不同路径 III","frequency":1.2970141712,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":18535,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5356764165826157,"acs":20713,"articleLive":2,"columnArticles":304,"formTitle":"[981]基于时间的键值存储","frequency":2.5847039065,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":38667,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5416852429781542,"acs":2430,"articleLive":2,"columnArticles":24,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4486,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6335074327038972,"acs":31536,"articleLive":2,"columnArticles":445,"formTitle":"[983]最低票价","frequency":2.3043300274,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":49780,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.41593766432429846,"acs":8701,"articleLive":2,"columnArticles":137,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":20919,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.598997118586985,"acs":16007,"articleLive":2,"columnArticles":177,"formTitle":"[985]查询后的偶数和","frequency":0.2768834642,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":26723,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6761043305867047,"acs":21826,"articleLive":2,"columnArticles":214,"formTitle":"[986]区间列表的交集","frequency":2.2119282355,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":32282,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5322530900808996,"acs":22435,"articleLive":2,"columnArticles":405,"formTitle":"[987]二叉树的垂序遍历","frequency":1.4355847086,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":42151,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.4953743118224644,"acs":8728,"articleLive":2,"columnArticles":106,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":17619,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4730189732142857,"acs":50859,"articleLive":2,"columnArticles":574,"formTitle":"[989]数组形式的整数加法","frequency":0.8058212079,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":107520,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.49867204099487566,"acs":31919,"articleLive":2,"columnArticles":484,"formTitle":"[990]等式方程的可满足性","frequency":0.2768834642,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":64008,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5177444069874348,"acs":8447,"articleLive":2,"columnArticles":106,"formTitle":"[991]坏了的计算器","frequency":0.8980524322,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":16315,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.45116687823454743,"acs":23102,"articleLive":2,"columnArticles":268,"formTitle":"[992]K 个不同整数的子数组","frequency":0.8660803995,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":51205,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5576064204882526,"acs":49816,"articleLive":2,"columnArticles":786,"formTitle":"[993]二叉树的堂兄弟节点","frequency":2.430005062,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":89339,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5090258309454105,"acs":49206,"articleLive":2,"columnArticles":1333,"formTitle":"[994]腐烂的橘子","frequency":1.8450487545,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":96667,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5402466110132496,"acs":21162,"articleLive":2,"columnArticles":251,"formTitle":"[995]K 连续位的最小翻转次数","frequency":1.229022426,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":39171,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.4966386554621849,"acs":4137,"articleLive":2,"columnArticles":84,"formTitle":"[996]正方形数组的数目","frequency":1.1218535916,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":8330,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5122618703723413,"acs":33693,"articleLive":2,"columnArticles":362,"formTitle":"[997]找到小镇的法官","frequency":0.7499407495,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":65773,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6142562834775442,"acs":7454,"articleLive":2,"columnArticles":107,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12135,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6913614311006875,"acs":30068,"articleLive":2,"columnArticles":564,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.2768834642,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":43491,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4065443129678821,"acs":3367,"articleLive":2,"columnArticles":40,"formTitle":"[1000]合并石头的最低成本","frequency":1.7395770104,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":8282,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.29132947976878615,"acs":2016,"articleLive":2,"columnArticles":50,"formTitle":"[1001]网格照明","frequency":0.0,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":6920,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7377143622722401,"acs":55063,"articleLive":2,"columnArticles":584,"formTitle":"[1002]查找常用字符","frequency":1.9600604803,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":74640,"title":"查找常用字符","titleSlug":"find-common-characters"},{"acceptance":0.5758062162556544,"acs":11838,"articleLive":2,"columnArticles":178,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":20559,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5985958687590235,"acs":63435,"articleLive":2,"columnArticles":679,"formTitle":"[1004]最大连续1的个数 III","frequency":2.4969142761,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"","submitted":105973,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5377415458937198,"acs":23153,"articleLive":2,"columnArticles":381,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":1.0798482563,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":43056,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6276720226033848,"acs":43986,"articleLive":2,"columnArticles":594,"formTitle":"[1006]笨阶乘","frequency":2.4996909759,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":70078,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.46389795763419633,"acs":6110,"articleLive":2,"columnArticles":81,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":13171,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7266759588148015,"acs":16162,"articleLive":2,"columnArticles":211,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":1.9925912299,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":22241,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5924270837489526,"acs":14848,"articleLive":2,"columnArticles":204,"formTitle":"[1009]十进制整数的反码","frequency":0.2768834642,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":25063,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.44961298377028713,"acs":18007,"articleLive":2,"columnArticles":240,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":40050,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6271691327801728,"acs":57899,"articleLive":2,"columnArticles":558,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":3.2946494733,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":92318,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3293615107913669,"acs":2930,"articleLive":2,"columnArticles":63,"formTitle":"[1012]至少有 1 位重复的数字","frequency":1.1218535916,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":8896,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.3982735758300616,"acs":45954,"articleLive":2,"columnArticles":909,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":1.7395770104,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":115383,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5451720275748924,"acs":34559,"articleLive":2,"columnArticles":419,"formTitle":"[1014]最佳观光组合","frequency":0.7773697867,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":63391,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35353459308891066,"acs":4696,"articleLive":2,"columnArticles":40,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.8980524322,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":13283,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5833044683062002,"acs":5052,"articleLive":2,"columnArticles":78,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":8661,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5616393442622951,"acs":3426,"articleLive":2,"columnArticles":52,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6100,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5167114046131553,"acs":43504,"articleLive":2,"columnArticles":369,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":84194,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5972983735105829,"acs":19500,"articleLive":2,"columnArticles":255,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.2768834642,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":32647,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5365325077399381,"acs":8665,"articleLive":2,"columnArticles":130,"formTitle":"[1020]飞地的数量","frequency":1.1969752486,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":16150,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7834599811414943,"acs":56500,"articleLive":2,"columnArticles":639,"formTitle":"[1021]删除最外层的括号","frequency":1.4623744168,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":72116,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7024424699802967,"acs":18895,"articleLive":2,"columnArticles":249,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.2768834642,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":26899,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5646098156410472,"acs":6707,"articleLive":2,"columnArticles":145,"formTitle":"[1023]驼峰式匹配","frequency":0.2768834642,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":11879,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5606563613099561,"acs":32425,"articleLive":2,"columnArticles":371,"formTitle":"[1024]视频拼接","frequency":0.8058212079,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":57834,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7096098203385595,"acs":73820,"articleLive":2,"columnArticles":635,"formTitle":"[1025]除数博弈","frequency":2.088441647,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":104029,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6678051160521363,"acs":9581,"articleLive":2,"columnArticles":163,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":14347,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.433234010117109,"acs":12504,"articleLive":2,"columnArticles":113,"formTitle":"[1027]最长等差数列","frequency":1.4951320132,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":28862,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7319322482272109,"acs":19921,"articleLive":2,"columnArticles":417,"formTitle":"[1028]从先序遍历还原二叉树","frequency":0.8660803995,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":27217,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6524905447815241,"acs":16217,"articleLive":2,"columnArticles":174,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"","submitted":24854,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7121637468462386,"acs":40082,"articleLive":2,"columnArticles":440,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.3327171103,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":56282,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5668501529051988,"acs":4634,"articleLive":2,"columnArticles":69,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.3041926436,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8175,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.39453317964762064,"acs":2396,"articleLive":2,"columnArticles":38,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6073,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.38913585601214357,"acs":10767,"articleLive":2,"columnArticles":161,"formTitle":"[1033]移动石子直到连续","frequency":0.2768834642,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":27669,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.4321318228630278,"acs":4196,"articleLive":2,"columnArticles":90,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":9710,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6274118555051484,"acs":33330,"articleLive":2,"columnArticles":367,"formTitle":"[1035]不相交的线","frequency":2.9322912281,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":53123,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.2997881355932203,"acs":3113,"articleLive":2,"columnArticles":52,"formTitle":"[1036]逃离大迷宫","frequency":0.3041926436,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":10384,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.4387293422869934,"acs":9212,"articleLive":2,"columnArticles":104,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":20997,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7936178620825923,"acs":24099,"articleLive":2,"columnArticles":307,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.2507039587,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":30366,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5534042826003334,"acs":4316,"articleLive":2,"columnArticles":58,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":7799,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.523517382413088,"acs":2560,"articleLive":2,"columnArticles":28,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":4890,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.48090861540760665,"acs":6436,"articleLive":2,"columnArticles":109,"formTitle":"[1041]困于环中的机器人","frequency":1.1969752486,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":13383,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.526348929574736,"acs":10867,"articleLive":2,"columnArticles":145,"formTitle":"[1042]不邻接植花","frequency":0.8058212079,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":20646,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6902030838661151,"acs":7341,"articleLive":2,"columnArticles":97,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":10636,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20936660875059232,"acs":5302,"articleLive":2,"columnArticles":69,"formTitle":"[1044]最长重复子串","frequency":2.5599501674,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":25324,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6444444444444445,"acs":7859,"articleLive":2,"columnArticles":97,"formTitle":"[1045]买下所有产品的客户","frequency":0.2768834642,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"","submitted":12195,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6595668092808952,"acs":64131,"articleLive":2,"columnArticles":894,"formTitle":"[1046]最后一块石头的重量","frequency":1.4951320132,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":97232,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7259896454437044,"acs":99841,"articleLive":2,"columnArticles":944,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":3.7043785933,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":137524,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.45026929982046676,"acs":8778,"articleLive":2,"columnArticles":123,"formTitle":"[1048]最长字符串链","frequency":1.4951320132,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":19495,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6416905092781819,"acs":39249,"articleLive":2,"columnArticles":382,"formTitle":"[1049]最后一块石头的重量 II","frequency":2.8562159835,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":61165,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7569288660539837,"acs":10460,"articleLive":2,"columnArticles":49,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":0.2768834642,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"","submitted":13819,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7518006088656783,"acs":30375,"articleLive":2,"columnArticles":356,"formTitle":"[1051]高度检查器","frequency":0.2768834642,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":40403,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5808950406554528,"acs":46794,"articleLive":2,"columnArticles":735,"formTitle":"[1052]爱生气的书店老板","frequency":1.6719059297,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":80555,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.45890085524231866,"acs":5795,"articleLive":2,"columnArticles":92,"formTitle":"[1053]交换一次的先前排列","frequency":0.8353654542,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":12628,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37534206411258797,"acs":7681,"articleLive":2,"columnArticles":104,"formTitle":"[1054]距离相等的条形码","frequency":0.8353654542,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":20464,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5865557865557866,"acs":4232,"articleLive":2,"columnArticles":74,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"","submitted":7215,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4060339409176619,"acs":3230,"articleLive":2,"columnArticles":60,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"","submitted":7955,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.4609895337773549,"acs":2907,"articleLive":2,"columnArticles":36,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"","submitted":6306,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.3380058185665168,"acs":1278,"articleLive":2,"columnArticles":28,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"","submitted":3781,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.35902287975227937,"acs":2087,"articleLive":2,"columnArticles":35,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"","submitted":5813,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5288737914815783,"acs":4048,"articleLive":2,"columnArticles":59,"formTitle":"[1060]有序数组中的缺失元素","frequency":1.4623744168,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"","submitted":7654,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.5988584474885845,"acs":2623,"articleLive":2,"columnArticles":57,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"","submitted":4380,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5354893617021277,"acs":3146,"articleLive":2,"columnArticles":39,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"","submitted":5875,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.6980676328502415,"acs":1734,"articleLive":2,"columnArticles":37,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"","submitted":2484,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6509513150531617,"acs":4653,"articleLive":2,"columnArticles":66,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"","submitted":7148,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5372585096596136,"acs":2336,"articleLive":2,"columnArticles":64,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"","submitted":4348,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.471923828125,"acs":1933,"articleLive":2,"columnArticles":38,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"","submitted":4096,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.419286094832179,"acs":787,"articleLive":2,"columnArticles":25,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"","submitted":1877,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8642816980601631,"acs":12297,"articleLive":2,"columnArticles":58,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"","submitted":14228,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8202433628318584,"acs":10381,"articleLive":2,"columnArticles":51,"formTitle":"[1069]产品销售分析 II","frequency":0.2768834642,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"","submitted":12656,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.48325198903523436,"acs":7228,"articleLive":2,"columnArticles":64,"formTitle":"[1070]产品销售分析 III","frequency":0.2768834642,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"","submitted":14957,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5865111718870942,"acs":34098,"articleLive":2,"columnArticles":659,"formTitle":"[1071]字符串的最大公因子","frequency":0.2768834642,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":58137,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5781533987640858,"acs":3181,"articleLive":2,"columnArticles":51,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.4966987206,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5502,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.337080270932411,"acs":2339,"articleLive":2,"columnArticles":51,"formTitle":"[1073]负二进制数相加","frequency":0.4966987206,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":6939,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6699719846652905,"acs":18175,"articleLive":2,"columnArticles":184,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":2.2690405504,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":27128,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6955697701966359,"acs":8808,"articleLive":2,"columnArticles":68,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"","submitted":12663,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4979205053961569,"acs":9458,"articleLive":2,"columnArticles":81,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"","submitted":18995,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7215803589849391,"acs":6995,"articleLive":2,"columnArticles":83,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"","submitted":9694,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6218957294008004,"acs":11344,"articleLive":2,"columnArticles":171,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":18241,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7350170648464164,"acs":10768,"articleLive":2,"columnArticles":178,"formTitle":"[1079]活字印刷","frequency":0.2507039587,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":14650,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.48980330638349223,"acs":4059,"articleLive":2,"columnArticles":80,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8287,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5717720207253886,"acs":13794,"articleLive":2,"columnArticles":133,"formTitle":"[1081]不同字符的最小子序列","frequency":2.0263098659,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":24125,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.759607173356106,"acs":10674,"articleLive":2,"columnArticles":89,"formTitle":"[1082]销售分析 I ","frequency":0.3327171103,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"","submitted":14052,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5273033830088111,"acs":9695,"articleLive":2,"columnArticles":93,"formTitle":"[1083]销售分析 II","frequency":0.8660803995,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"","submitted":18386,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5391084945332212,"acs":9615,"articleLive":2,"columnArticles":93,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"","submitted":17835,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7731573157315732,"acs":3514,"articleLive":2,"columnArticles":70,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"","submitted":4545,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6899018232819074,"acs":4919,"articleLive":2,"columnArticles":76,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"","submitted":7130,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5304428044280443,"acs":1725,"articleLive":2,"columnArticles":50,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"","submitted":3252,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.44483985765124556,"acs":1000,"articleLive":2,"columnArticles":33,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"","submitted":2248,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5854074542008844,"acs":18534,"articleLive":2,"columnArticles":274,"formTitle":"[1089]复写零","frequency":0.2507039587,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":31660,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5411174785100287,"acs":3777,"articleLive":2,"columnArticles":75,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":6980,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.3774371117534904,"acs":24547,"articleLive":2,"columnArticles":257,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":1.9600604803,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":65036,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4880095923261391,"acs":2442,"articleLive":2,"columnArticles":46,"formTitle":"[1092]最短公共超序列","frequency":0.9313777419,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5004,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.38715676621813805,"acs":3539,"articleLive":2,"columnArticles":53,"formTitle":"[1093]大样本统计","frequency":0.4966987206,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":9141,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.618327310273619,"acs":23954,"articleLive":2,"columnArticles":355,"formTitle":"[1094]拼车","frequency":0.7773697867,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":38740,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3730464148276133,"acs":19000,"articleLive":2,"columnArticles":377,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":50932,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5590083798882681,"acs":1601,"articleLive":2,"columnArticles":45,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":2864,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.521341178668161,"acs":5582,"articleLive":2,"columnArticles":98,"formTitle":"[1097]游戏玩法分析 V","frequency":1.5645561361,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"","submitted":10707,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.47486661050266776,"acs":6764,"articleLive":2,"columnArticles":95,"formTitle":"[1098]小众书籍","frequency":0.8660803995,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"","submitted":14244,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5794463405384908,"acs":4584,"articleLive":2,"columnArticles":84,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"","submitted":7911,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.6975488765684272,"acs":4781,"articleLive":2,"columnArticles":95,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"","submitted":6854,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6687045123726346,"acs":2297,"articleLive":2,"columnArticles":50,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"","submitted":3435,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.36572077185017027,"acs":4833,"articleLive":2,"columnArticles":62,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"","submitted":13215,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6364416058394161,"acs":34877,"articleLive":2,"columnArticles":1091,"formTitle":"[1103]分糖果 II","frequency":0.8353654542,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":54800,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.761332074962923,"acs":28234,"articleLive":2,"columnArticles":659,"formTitle":"[1104]二叉树寻路","frequency":1.0269957982,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":37085,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5556171675723633,"acs":5010,"articleLive":2,"columnArticles":64,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9017,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5731208574249048,"acs":4064,"articleLive":2,"columnArticles":119,"formTitle":"[1106]解析布尔表达式","frequency":0.8980524322,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7091,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.41132688273902157,"acs":6079,"articleLive":2,"columnArticles":82,"formTitle":"[1107]每日新用户统计","frequency":0.3041926436,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"","submitted":14779,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8390374807636054,"acs":65971,"articleLive":2,"columnArticles":670,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":78627,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5075838235037439,"acs":29081,"articleLive":2,"columnArticles":270,"formTitle":"[1109]航班预订统计","frequency":1.9286395831,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"","submitted":57293,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6264720019226148,"acs":10427,"articleLive":2,"columnArticles":194,"formTitle":"[1110]删点成林","frequency":0.8980524322,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":16644,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.772565512779036,"acs":23880,"articleLive":2,"columnArticles":397,"formTitle":"[1111]有效括号的嵌套深度","frequency":1.229022426,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":30910,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6413043478260869,"acs":7021,"articleLive":2,"columnArticles":79,"formTitle":"[1112]每位学生的最高成绩","frequency":0.8353654542,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"","submitted":10948,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5430605592726025,"acs":6331,"articleLive":2,"columnArticles":45,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"","submitted":11658,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6525691840108064,"acs":73431,"articleLive":2,"columnArticles":550,"formTitle":"[1114]按序打印","frequency":3.9667103591,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":112526,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5609981388295305,"acs":40692,"articleLive":2,"columnArticles":464,"formTitle":"[1115]交替打印FooBar","frequency":2.7677237874,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":72535,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5144816517108047,"acs":21156,"articleLive":2,"columnArticles":349,"formTitle":"[1116]打印零与奇偶数","frequency":2.7332867038,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":41121,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5209056459573926,"acs":16358,"articleLive":2,"columnArticles":241,"formTitle":"[1117]H2O 生成","frequency":2.2022005323,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":31403,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6404816513761468,"acs":2234,"articleLive":2,"columnArticles":34,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"","submitted":3488,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8661092294665538,"acs":8183,"articleLive":2,"columnArticles":141,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"","submitted":9448,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6027529582226515,"acs":2496,"articleLive":2,"columnArticles":45,"formTitle":"[1120]子树的最大平均值","frequency":0.3327171103,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"","submitted":4141,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.571042679632631,"acs":1057,"articleLive":2,"columnArticles":17,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"","submitted":1851,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.707038886468492,"acs":63292,"articleLive":2,"columnArticles":853,"formTitle":"[1122]数组的相对排序","frequency":2.4498082495,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":89517,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7043398812243034,"acs":7709,"articleLive":2,"columnArticles":99,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":10945,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.31484132975815476,"acs":12094,"articleLive":2,"columnArticles":125,"formTitle":"[1124]表现良好的最长时间段","frequency":0.3327171103,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":38413,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.490129913953096,"acs":2905,"articleLive":2,"columnArticles":49,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":5927,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6959929212488939,"acs":5506,"articleLive":2,"columnArticles":83,"formTitle":"[1126]查询活跃业务","frequency":0.2768834642,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"","submitted":7911,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.4181421016325592,"acs":3637,"articleLive":2,"columnArticles":67,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"","submitted":8698,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5448843707270673,"acs":36662,"articleLive":2,"columnArticles":474,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.8058212079,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":67284,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.37865803339046533,"acs":5965,"articleLive":2,"columnArticles":106,"formTitle":"[1129]颜色交替的最短路径","frequency":0.3327171103,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":15753,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6266963292547275,"acs":5634,"articleLive":2,"columnArticles":98,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":8990,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.4527347939328941,"acs":2955,"articleLive":2,"columnArticles":43,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6527,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.3934653831914106,"acs":4251,"articleLive":2,"columnArticles":46,"formTitle":"[1132]报告的记录 II","frequency":0.8353654542,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"","submitted":10804,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.643398392652124,"acs":2802,"articleLive":2,"columnArticles":57,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"","submitted":4355,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7738998482549317,"acs":3060,"articleLive":2,"columnArticles":50,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"","submitted":3954,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5346203824020791,"acs":5760,"articleLive":2,"columnArticles":68,"formTitle":"[1135]最低成本联通所有城市","frequency":1.1661086006,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"","submitted":10774,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5664478152592257,"acs":2502,"articleLive":2,"columnArticles":47,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"","submitted":4417,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6054264989440823,"acs":65937,"articleLive":2,"columnArticles":786,"formTitle":"[1137]第 N 个泰波那契数","frequency":0.6185183208,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":108910,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.4314209037499093,"acs":5948,"articleLive":2,"columnArticles":134,"formTitle":"[1138]字母板上的路径","frequency":0.3041926436,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":13787,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.4763744113445156,"acs":9003,"articleLive":2,"columnArticles":144,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":0.8980524322,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":18899,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6540016168148747,"acs":6472,"articleLive":2,"columnArticles":93,"formTitle":"[1140]石子游戏 II","frequency":0.3327171103,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":9896,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5125739236168684,"acs":9274,"articleLive":2,"columnArticles":63,"formTitle":"[1141]查询近30天活跃用户数","frequency":0.2768834642,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"","submitted":18093,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.37131585054537014,"acs":6400,"articleLive":2,"columnArticles":48,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"","submitted":17236,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6321611477257854,"acs":149728,"articleLive":2,"columnArticles":1035,"formTitle":"[1143]最长公共子序列","frequency":3.9485586874,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":236851,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.44165422776363156,"acs":10060,"articleLive":2,"columnArticles":142,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":1.1661086006,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":22778,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4687522788594764,"acs":6428,"articleLive":2,"columnArticles":103,"formTitle":"[1145]二叉树着色游戏","frequency":1.7051051014,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":13713,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2862448117672759,"acs":3931,"articleLive":2,"columnArticles":59,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":13733,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5546038543897216,"acs":3626,"articleLive":2,"columnArticles":72,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":6538,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7183070671027852,"acs":7247,"articleLive":2,"columnArticles":32,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"","submitted":10089,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.44395186827105765,"acs":4907,"articleLive":2,"columnArticles":43,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"","submitted":11053,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6073034473361494,"acs":4457,"articleLive":2,"columnArticles":79,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.8980524322,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"","submitted":7339,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.4831204956378809,"acs":3821,"articleLive":2,"columnArticles":54,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.7773697867,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"","submitted":7909,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.38277945619335346,"acs":1267,"articleLive":2,"columnArticles":29,"formTitle":"[1152]用户网站访问行为分析","frequency":0.7499407495,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"","submitted":3310,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.37108759288448545,"acs":1648,"articleLive":2,"columnArticles":23,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"","submitted":4441,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5653725078698846,"acs":13470,"articleLive":2,"columnArticles":214,"formTitle":"[1154]一年中的第几天","frequency":0.2507039587,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":23825,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4795088502631159,"acs":9021,"articleLive":2,"columnArticles":120,"formTitle":"[1155]掷骰子的N种方法","frequency":0.3041926436,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":18813,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.43423703975087014,"acs":4741,"articleLive":2,"columnArticles":74,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.3041926436,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":10918,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.312506899216249,"acs":2831,"articleLive":2,"columnArticles":43,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.4966987206,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9059,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5518717751674168,"acs":5027,"articleLive":2,"columnArticles":57,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"","submitted":9109,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.49582132564841497,"acs":3441,"articleLive":2,"columnArticles":73,"formTitle":"[1159]市场分析 II","frequency":0.966163858,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"","submitted":6940,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6877250988959084,"acs":58240,"articleLive":2,"columnArticles":896,"formTitle":"[1160]拼写单词","frequency":0.8353654542,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":84685,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6342664754660515,"acs":10173,"articleLive":2,"columnArticles":163,"formTitle":"[1161]最大层内元素和","frequency":0.0,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":16039,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4688578035558588,"acs":37104,"articleLive":2,"columnArticles":486,"formTitle":"[1162]地图分析","frequency":1.5645561361,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":79137,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2671280924098583,"acs":5712,"articleLive":2,"columnArticles":94,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.3625522588,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":21383,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6177478435542951,"acs":5228,"articleLive":2,"columnArticles":75,"formTitle":"[1164]指定日期的产品价格","frequency":0.8660803995,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"","submitted":8463,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8381587876046144,"acs":7411,"articleLive":2,"columnArticles":110,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"","submitted":8842,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.4817474566128067,"acs":2415,"articleLive":2,"columnArticles":44,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"","submitted":5013,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.42002727449834404,"acs":2156,"articleLive":2,"columnArticles":33,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"","submitted":5133,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5687830687830688,"acs":1505,"articleLive":2,"columnArticles":23,"formTitle":"[1168]水资源分配优化","frequency":0.532340412,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"","submitted":2646,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3224590976698066,"acs":6504,"articleLive":2,"columnArticles":76,"formTitle":"[1169]查询无效交易","frequency":0.9313777419,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":20170,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6172046955245781,"acs":13460,"articleLive":2,"columnArticles":209,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.3327171103,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":21808,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.4716674232107732,"acs":12469,"articleLive":2,"columnArticles":148,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":0.3041926436,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":26436,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2703804347826087,"acs":2388,"articleLive":2,"columnArticles":50,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":8832,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7584672934991407,"acs":7502,"articleLive":2,"columnArticles":72,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"","submitted":9891,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6190804915090432,"acs":4484,"articleLive":2,"columnArticles":56,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"","submitted":7243,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.48748231966053746,"acs":6893,"articleLive":2,"columnArticles":106,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":14140,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.4445040790038643,"acs":4141,"articleLive":2,"columnArticles":56,"formTitle":"[1176]健身计划评估","frequency":0.3625522588,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"","submitted":9316,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.26345206937852106,"acs":5939,"articleLive":2,"columnArticles":89,"formTitle":"[1177]构建回文串检测","frequency":0.3327171103,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":22543,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.4621297478654949,"acs":18457,"articleLive":2,"columnArticles":181,"formTitle":"[1178]猜字谜","frequency":2.1901811569,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":39939,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6339204608397031,"acs":28612,"articleLive":2,"columnArticles":173,"formTitle":"[1179]重新格式化部门表","frequency":2.5693047726,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":45135,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7729022324865281,"acs":3012,"articleLive":2,"columnArticles":64,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.3625522588,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"","submitted":3897,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.3689839572192513,"acs":1449,"articleLive":2,"columnArticles":27,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"","submitted":3927,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.3839419175742046,"acs":1798,"articleLive":2,"columnArticles":36,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"","submitted":4683,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.5990430622009569,"acs":626,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"","submitted":1045,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5849218538260006,"acs":12949,"articleLive":2,"columnArticles":250,"formTitle":"[1184]公交站间的距离","frequency":0.8353654542,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":22138,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6100904545199168,"acs":10859,"articleLive":2,"columnArticles":192,"formTitle":"[1185]一周中的第几天","frequency":0.8058212079,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":17799,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39072518240106124,"acs":7069,"articleLive":2,"columnArticles":104,"formTitle":"[1186]删除一次得到子数组最大和","frequency":1.3331626853,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":18092,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.43687872763419483,"acs":1758,"articleLive":2,"columnArticles":31,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4024,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6917514124293785,"acs":3061,"articleLive":2,"columnArticles":63,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"","submitted":4425,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6445382450754669,"acs":20156,"articleLive":2,"columnArticles":309,"formTitle":"[1189]“气球” 的最大数量","frequency":0.2507039587,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":31272,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6510615467157201,"acs":42472,"articleLive":2,"columnArticles":594,"formTitle":"[1190]反转每对括号间的子串","frequency":4.5830206656,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":65235,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2678439690151236,"acs":5809,"articleLive":2,"columnArticles":91,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":21688,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.49904373326533213,"acs":3914,"articleLive":2,"columnArticles":43,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":7843,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6110780226325193,"acs":5130,"articleLive":2,"columnArticles":66,"formTitle":"[1193]每月交易 I","frequency":0.2768834642,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"","submitted":8395,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5132533922372988,"acs":3253,"articleLive":2,"columnArticles":57,"formTitle":"[1194]锦标赛优胜者","frequency":0.3041926436,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"","submitted":6338,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6354518322814228,"acs":12988,"articleLive":2,"columnArticles":254,"formTitle":"[1195]交替打印字符串","frequency":1.4308011549,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":20439,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6914273824386183,"acs":3323,"articleLive":2,"columnArticles":53,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"","submitted":4806,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.36568144499178984,"acs":4454,"articleLive":2,"columnArticles":58,"formTitle":"[1197]进击的骑士","frequency":0.9313777419,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"","submitted":12180,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7482842147759386,"acs":3707,"articleLive":2,"columnArticles":55,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"","submitted":4954,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.4317904993909866,"acs":709,"articleLive":2,"columnArticles":16,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"","submitted":1642,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6858590695076211,"acs":17189,"articleLive":2,"columnArticles":240,"formTitle":"[1200]最小绝对差","frequency":0.8353654542,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":25062,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24687726478236774,"acs":5791,"articleLive":2,"columnArticles":82,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":23457,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5024402333473138,"acs":26355,"articleLive":2,"columnArticles":291,"formTitle":"[1202]交换字符串中的元素","frequency":0.3041926436,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":52454,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6249478732276897,"acs":11989,"articleLive":2,"columnArticles":141,"formTitle":"[1203]项目管理","frequency":0.4610570293,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19184,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7268408551068883,"acs":5202,"articleLive":2,"columnArticles":76,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.8660803995,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"","submitted":7157,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.46795985331017176,"acs":4849,"articleLive":2,"columnArticles":76,"formTitle":"[1205]每月交易II","frequency":1.229022426,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"","submitted":10362,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6184782608695653,"acs":6259,"articleLive":2,"columnArticles":84,"formTitle":"[1206]设计跳表","frequency":0.8660803995,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":10120,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7301927460112972,"acs":58947,"articleLive":2,"columnArticles":817,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":80728,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.49642453068532577,"acs":45193,"articleLive":2,"columnArticles":595,"formTitle":"[1208]尽可能使字符串相等","frequency":1.4951320132,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":91037,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5332064788601661,"acs":11489,"articleLive":2,"columnArticles":155,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":1.7395770104,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":21547,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.4482274482274482,"acs":2554,"articleLive":2,"columnArticles":51,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5698,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6589803463708893,"acs":6773,"articleLive":2,"columnArticles":58,"formTitle":"[1211]查询结果的质量和占比","frequency":0.8353654542,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"","submitted":10278,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5154842960685262,"acs":4694,"articleLive":2,"columnArticles":92,"formTitle":"[1212]查询球队积分","frequency":0.2768834642,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"","submitted":9106,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7726158038147138,"acs":5671,"articleLive":2,"columnArticles":118,"formTitle":"[1213]三个有序数组的交集","frequency":0.8980524322,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"","submitted":7340,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6317341722375147,"acs":3213,"articleLive":2,"columnArticles":66,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.4265946251,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"","submitted":5086,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.40840190558683415,"acs":1886,"articleLive":2,"columnArticles":39,"formTitle":"[1215]步进数","frequency":1.2623366327,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"","submitted":4618,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5322518346852066,"acs":1378,"articleLive":2,"columnArticles":36,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"","submitted":2589,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6942994913798798,"acs":21022,"articleLive":2,"columnArticles":343,"formTitle":"[1217]玩筹码","frequency":1.7051051014,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"","submitted":30278,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.4215499947207264,"acs":7985,"articleLive":2,"columnArticles":106,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":18942,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6315991027955578,"acs":11545,"articleLive":2,"columnArticles":165,"formTitle":"[1219]黄金矿工","frequency":1.7051051014,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":18279,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5264643613267467,"acs":3730,"articleLive":2,"columnArticles":68,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7085,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8041382600226591,"acs":40457,"articleLive":2,"columnArticles":649,"formTitle":"[1221]分割平衡字符串","frequency":0.8058212079,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"","submitted":50311,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6713244228432563,"acs":5525,"articleLive":2,"columnArticles":121,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8230,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4735225277940316,"acs":3237,"articleLive":2,"columnArticles":55,"formTitle":"[1223]掷骰子模拟","frequency":0.4966987206,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":6836,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.32451802479753455,"acs":4528,"articleLive":2,"columnArticles":66,"formTitle":"[1224]最大相等频率","frequency":1.2623366327,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":13953,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5470085470085471,"acs":3008,"articleLive":2,"columnArticles":71,"formTitle":"[1225]报告系统状态的连续日期","frequency":1.0018055493,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"","submitted":5499,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.6007749851999354,"acs":11163,"articleLive":2,"columnArticles":130,"formTitle":"[1226]哲学家进餐","frequency":2.5148736074,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":18581,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6618413830954994,"acs":9647,"articleLive":2,"columnArticles":150,"formTitle":"[1227]飞机座位分配概率","frequency":0.2507039587,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":14576,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5395213923132705,"acs":2976,"articleLive":2,"columnArticles":48,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"","submitted":5516,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.4116022099447514,"acs":2235,"articleLive":2,"columnArticles":40,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"","submitted":5430,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.4866581956797967,"acs":2681,"articleLive":2,"columnArticles":53,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"","submitted":5509,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5546764049502941,"acs":2734,"articleLive":2,"columnArticles":40,"formTitle":"[1231]分享巧克力","frequency":1.0398908834,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"","submitted":4929,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.4690606099056803,"acs":33270,"articleLive":2,"columnArticles":409,"formTitle":"[1232]缀点成线","frequency":0.8058212079,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":70929,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.48220719297136716,"acs":7629,"articleLive":2,"columnArticles":109,"formTitle":"[1233]删除子文件夹","frequency":0.3041926436,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":15821,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.3415367952343703,"acs":5676,"articleLive":2,"columnArticles":83,"formTitle":"[1234]替换子串得到平衡字符串","frequency":0.8660803995,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":16619,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.45030425963488846,"acs":5550,"articleLive":2,"columnArticles":99,"formTitle":"[1235]规划兼职工作","frequency":1.9133230025,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":12325,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5592369477911646,"acs":1114,"articleLive":2,"columnArticles":31,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"","submitted":1992,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7116656003412242,"acs":10011,"articleLive":2,"columnArticles":126,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14067,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.654965563208176,"acs":2948,"articleLive":2,"columnArticles":69,"formTitle":"[1238]循环码排列","frequency":0.3938048023,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4501,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.49073740358970663,"acs":34040,"articleLive":2,"columnArticles":381,"formTitle":"[1239]串联字符串的最大长度","frequency":2.0263098659,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":69365,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.4948328267477204,"acs":2442,"articleLive":2,"columnArticles":38,"formTitle":"[1240]铺瓷砖","frequency":1.6398929527,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":4935,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5969983883964545,"acs":5927,"articleLive":2,"columnArticles":63,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"","submitted":9928,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.4606786427145709,"acs":1154,"articleLive":2,"columnArticles":19,"formTitle":"[1242]多线程网页爬虫","frequency":1.0018055493,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"","submitted":2505,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5390222984562607,"acs":2514,"articleLive":2,"columnArticles":50,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"","submitted":4664,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6230352303523036,"acs":2299,"articleLive":2,"columnArticles":37,"formTitle":"[1244]力扣排行榜","frequency":0.4610570293,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"","submitted":3690,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5050566037735849,"acs":3346,"articleLive":2,"columnArticles":60,"formTitle":"[1245]树的直径","frequency":0.3327171103,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"","submitted":6625,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4788732394366197,"acs":2856,"articleLive":2,"columnArticles":38,"formTitle":"[1246]删除回文子数组","frequency":0.7499407495,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"","submitted":5964,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6153379812064262,"acs":8120,"articleLive":2,"columnArticles":150,"formTitle":"[1247]交换字符使得字符串相同","frequency":1.5645561361,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"","submitted":13196,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5583754656732305,"acs":33574,"articleLive":2,"columnArticles":460,"formTitle":"[1248]统计「优美子数组」","frequency":0.8058212079,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":60128,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5716609235010338,"acs":20737,"articleLive":2,"columnArticles":303,"formTitle":"[1249]移除无效的括号","frequency":1.8127357656,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":36275,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5602240896358543,"acs":2600,"articleLive":2,"columnArticles":36,"formTitle":"[1250]检查「好数组」","frequency":0.8980524322,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4641,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7719406041986687,"acs":7538,"articleLive":2,"columnArticles":93,"formTitle":"[1251]平均售价","frequency":0.2768834642,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"","submitted":9765,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7497980184547349,"acs":17633,"articleLive":2,"columnArticles":301,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":23517,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.39357833655706,"acs":5087,"articleLive":2,"columnArticles":75,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":1.0018055493,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":12925,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.599197247706422,"acs":13585,"articleLive":2,"columnArticles":209,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.2255770086,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":22672,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6766481526201401,"acs":2802,"articleLive":2,"columnArticles":60,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4141,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6617712505562973,"acs":1487,"articleLive":2,"columnArticles":34,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"","submitted":2247,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5637755102040817,"acs":1768,"articleLive":2,"columnArticles":37,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"","submitted":3136,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5638703527168732,"acs":1183,"articleLive":2,"columnArticles":42,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"","submitted":2098,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.4759651307596513,"acs":1911,"articleLive":2,"columnArticles":44,"formTitle":"[1259]不相交的握手","frequency":0.7499407495,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"","submitted":4015,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6033838383838384,"acs":11947,"articleLive":2,"columnArticles":242,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":19800,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.729899128390951,"acs":7453,"articleLive":2,"columnArticles":96,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":10211,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5263628620102214,"acs":12359,"articleLive":2,"columnArticles":186,"formTitle":"[1262]可被三整除的最大和","frequency":2.088441647,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":23480,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4174410293066476,"acs":2920,"articleLive":2,"columnArticles":56,"formTitle":"[1263]推箱子","frequency":0.532340412,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":6995,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.57337406134657,"acs":4505,"articleLive":2,"columnArticles":80,"formTitle":"[1264]页面推荐","frequency":0.3327171103,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"","submitted":7857,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.92018779342723,"acs":2548,"articleLive":2,"columnArticles":61,"formTitle":"[1265]逆序打印不可变链表","frequency":0.3327171103,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"","submitted":2769,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8236266352914811,"acs":29401,"articleLive":2,"columnArticles":448,"formTitle":"[1266]访问所有点的最小时间","frequency":1.1661086006,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":35697,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6088867847964291,"acs":9003,"articleLive":2,"columnArticles":143,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":14786,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.580421216848674,"acs":7441,"articleLive":2,"columnArticles":135,"formTitle":"[1268]搜索推荐系统","frequency":0.3041926436,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"","submitted":12820,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4917984432609586,"acs":30012,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":2.3043300274,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":61025,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8041767987412387,"acs":5622,"articleLive":2,"columnArticles":76,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.7773697867,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"","submitted":6991,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5044548154433602,"acs":2378,"articleLive":2,"columnArticles":38,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"","submitted":4714,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5178691840863116,"acs":1536,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"","submitted":2966,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.539124192390524,"acs":1502,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"","submitted":2786,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.5952685421994884,"acs":931,"articleLive":2,"columnArticles":23,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"","submitted":1564,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5399890440975076,"acs":7886,"articleLive":2,"columnArticles":165,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.8058212079,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":14604,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5010294583465316,"acs":6327,"articleLive":2,"columnArticles":94,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":12628,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7239315552699229,"acs":18023,"articleLive":2,"columnArticles":225,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":1.1969752486,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":24896,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5954561465304685,"acs":3381,"articleLive":2,"columnArticles":58,"formTitle":"[1278]分割回文串 III","frequency":2.866869569,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":5678,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6209912536443148,"acs":1491,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":1.0798482563,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"","submitted":2401,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5062325733967525,"acs":6173,"articleLive":2,"columnArticles":65,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.8058212079,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"","submitted":12194,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8313744481904372,"acs":44634,"articleLive":2,"columnArticles":604,"formTitle":"[1281]整数的各位积和之差","frequency":1.1969752486,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":53687,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8113530539578198,"acs":11849,"articleLive":2,"columnArticles":222,"formTitle":"[1282]用户分组","frequency":0.2768834642,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":14604,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.41581948921398465,"acs":6708,"articleLive":2,"columnArticles":95,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.8353654542,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":16132,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6588328492210193,"acs":2495,"articleLive":2,"columnArticles":58,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":1.0798482563,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":3787,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8123126124325405,"acs":4064,"articleLive":2,"columnArticles":55,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"","submitted":5003,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6445816956765862,"acs":4592,"articleLive":2,"columnArticles":86,"formTitle":"[1286]字母组合迭代器","frequency":0.8353654542,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7124,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6056435522618999,"acs":14874,"articleLive":2,"columnArticles":213,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":0.8353654542,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":24559,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5631597781356236,"acs":12590,"articleLive":2,"columnArticles":161,"formTitle":"[1288]删除被覆盖区间","frequency":1.4308011549,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":22356,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6310067405957817,"acs":5804,"articleLive":2,"columnArticles":84,"formTitle":"[1289]下降路径最小和  II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":9198,"title":"下降路径最小和  II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8089712881450836,"acs":52012,"articleLive":2,"columnArticles":680,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":64294,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5176189374662657,"acs":6713,"articleLive":2,"columnArticles":147,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":12969,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.46849904793443164,"acs":5659,"articleLive":2,"columnArticles":89,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.3041926436,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":12079,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.35584567991785243,"acs":12129,"articleLive":2,"columnArticles":122,"formTitle":"[1293]网格中的最短路径","frequency":2.7000389606,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":34085,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6612493651599797,"acs":6510,"articleLive":2,"columnArticles":71,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"","submitted":9845,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.809353507565337,"acs":47072,"articleLive":2,"columnArticles":625,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.2768834642,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":58160,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.45135217259191734,"acs":7427,"articleLive":2,"columnArticles":119,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":16455,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.45993518927677124,"acs":6245,"articleLive":2,"columnArticles":87,"formTitle":"[1297]子串的最大出现次数","frequency":1.2623366327,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":13578,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5946820809248555,"acs":2572,"articleLive":2,"columnArticles":87,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4325,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7855558489569581,"acs":29749,"articleLive":2,"columnArticles":424,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":37870,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4674658884770092,"acs":23708,"articleLive":2,"columnArticles":361,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.2768834642,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":50716,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.35722134049566595,"acs":2926,"articleLive":2,"columnArticles":68,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":8191,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8163913043478261,"acs":18777,"articleLive":2,"columnArticles":283,"formTitle":"[1302]层数最深叶子节点的和","frequency":1.229022426,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":23000,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8213262180057318,"acs":8311,"articleLive":2,"columnArticles":79,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"","submitted":10119,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7257702294897888,"acs":20683,"articleLive":2,"columnArticles":370,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.2507039587,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":28498,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7472299886092989,"acs":14432,"articleLive":2,"columnArticles":214,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.2507039587,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":19314,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5769693112713902,"acs":16319,"articleLive":2,"columnArticles":258,"formTitle":"[1306]跳跃游戏 III","frequency":0.8660803995,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":28284,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.3320290665176076,"acs":1782,"articleLive":2,"columnArticles":52,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5367,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7515923566878981,"acs":4956,"articleLive":2,"columnArticles":55,"formTitle":"[1308]不同性别每日分数总计","frequency":0.3041926436,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"","submitted":6594,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.755223880597015,"acs":16192,"articleLive":2,"columnArticles":277,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":21440,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7122614957588462,"acs":36695,"articleLive":2,"columnArticles":498,"formTitle":"[1310]子数组异或查询","frequency":2.5599501674,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":51519,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.37563308947664603,"acs":5340,"articleLive":2,"columnArticles":82,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.3625522588,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":14216,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6656393397712486,"acs":9719,"articleLive":2,"columnArticles":140,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":1.6719059297,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":14601,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8309366404478116,"acs":34439,"articleLive":2,"columnArticles":536,"formTitle":"[1313]解压缩编码列表","frequency":0.2768834642,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":41446,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7334011332267907,"acs":10096,"articleLive":2,"columnArticles":173,"formTitle":"[1314]矩阵区域和","frequency":1.6719059297,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":13766,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8096474712718301,"acs":12471,"articleLive":2,"columnArticles":255,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":15403,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.4356566155874114,"acs":2644,"articleLive":2,"columnArticles":55,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6069,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6141358641358642,"acs":9836,"articleLive":2,"columnArticles":184,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":16016,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6487199208878145,"acs":5904,"articleLive":2,"columnArticles":101,"formTitle":"[1318]或运算的最小翻转次数","frequency":3.1887736265,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":9101,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6177659530586148,"acs":29953,"articleLive":2,"columnArticles":507,"formTitle":"[1319]连通网络的操作次数","frequency":0.3041926436,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":48486,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5874538745387454,"acs":2388,"articleLive":2,"columnArticles":55,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4065,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.618025102071677,"acs":4087,"articleLive":2,"columnArticles":73,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"","submitted":6613,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5921888103510243,"acs":4943,"articleLive":2,"columnArticles":63,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"","submitted":8347,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7554049278807543,"acs":23515,"articleLive":2,"columnArticles":465,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":1.1969752486,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":31129,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5922653082441002,"acs":5697,"articleLive":2,"columnArticles":112,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":9619,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7277376654632972,"acs":9676,"articleLive":2,"columnArticles":173,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.2768834642,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":13296,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47566526610644255,"acs":5434,"articleLive":2,"columnArticles":91,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.3938048023,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":11424,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6941701609630732,"acs":5132,"articleLive":2,"columnArticles":51,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"","submitted":7393,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.4564936115154456,"acs":5645,"articleLive":2,"columnArticles":113,"formTitle":"[1328]破坏回文串","frequency":0.8660803995,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":12366,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7741043658564681,"acs":6720,"articleLive":2,"columnArticles":152,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.3625522588,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":8681,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.3758747084305232,"acs":1128,"articleLive":2,"columnArticles":28,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.7499407495,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3001,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.534555445028658,"acs":11285,"articleLive":2,"columnArticles":192,"formTitle":"[1331]数组序号转换","frequency":0.2507039587,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":21111,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6827948796098751,"acs":8961,"articleLive":2,"columnArticles":130,"formTitle":"[1332]删除回文子序列","frequency":0.2768834642,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":13124,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5417881926983807,"acs":5387,"articleLive":2,"columnArticles":114,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":9943,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.486219739292365,"acs":5222,"articleLive":2,"columnArticles":88,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":2.4067736718,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":10740,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5817988668555241,"acs":3286,"articleLive":2,"columnArticles":55,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":5648,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.42223910840932116,"acs":1667,"articleLive":2,"columnArticles":46,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"","submitted":3948,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7071071522531664,"acs":37628,"articleLive":2,"columnArticles":604,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":0.6813267377,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":53214,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.640152626944526,"acs":8724,"articleLive":2,"columnArticles":123,"formTitle":"[1338]数组大小减半","frequency":0.2507039587,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":13628,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.39704186512910505,"acs":7919,"articleLive":2,"columnArticles":127,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.3625522588,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":19945,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5709638064253761,"acs":4212,"articleLive":2,"columnArticles":94,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7377,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.48327424078927084,"acs":3135,"articleLive":2,"columnArticles":45,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"","submitted":6487,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8203030122041052,"acs":41203,"articleLive":2,"columnArticles":628,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":50229,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5415777322820926,"acs":12433,"articleLive":2,"columnArticles":210,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":22957,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5925044000414121,"acs":5723,"articleLive":2,"columnArticles":116,"formTitle":"[1344]时钟指针的夹角","frequency":0.3041926436,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":9659,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.3674538941223298,"acs":5539,"articleLive":2,"columnArticles":107,"formTitle":"[1345]跳跃游戏 IV","frequency":0.3625522588,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":15074,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.43607664977575866,"acs":14974,"articleLive":2,"columnArticles":256,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":34338,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7376664056382146,"acs":7536,"articleLive":2,"columnArticles":110,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":10216,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.30277078085642317,"acs":3005,"articleLive":2,"columnArticles":47,"formTitle":"[1348]推文计数","frequency":0.4265946251,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":9925,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5003379520108144,"acs":2961,"articleLive":2,"columnArticles":93,"formTitle":"[1349]参加考试的最大学生数","frequency":0.3625522588,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":5918,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8477611940298507,"acs":7952,"articleLive":2,"columnArticles":82,"formTitle":"[1350]院系无效的学生","frequency":0.2768834642,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"","submitted":9380,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7543429495539673,"acs":28920,"articleLive":2,"columnArticles":534,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.2507039587,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":38338,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.44112699747687134,"acs":6294,"articleLive":2,"columnArticles":70,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.3327171103,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":14268,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28267067955013464,"acs":10707,"articleLive":2,"columnArticles":146,"formTitle":"[1353]最多可以参加的会议数目","frequency":2.5491509264,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":37878,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.28476278307203606,"acs":2779,"articleLive":2,"columnArticles":69,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":9759,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6621370067014147,"acs":3557,"articleLive":2,"columnArticles":53,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"","submitted":5372,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7318542510121457,"acs":45192,"articleLive":2,"columnArticles":498,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":0.8058212079,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":61750,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5266444629475437,"acs":3795,"articleLive":2,"columnArticles":40,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":7206,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.48463181353886153,"acs":5219,"articleLive":2,"columnArticles":107,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.2768834642,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":10769,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.544,"acs":2652,"articleLive":2,"columnArticles":64,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":4875,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5030040260142459,"acs":8121,"articleLive":2,"columnArticles":134,"formTitle":"[1360]日期之间隔几天","frequency":1.6719059297,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":16145,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.40136247516321316,"acs":7070,"articleLive":2,"columnArticles":188,"formTitle":"[1361]验证二叉树","frequency":0.2507039587,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":17615,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5233203205259914,"acs":5094,"articleLive":2,"columnArticles":67,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":9734,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.3600031162355874,"acs":4621,"articleLive":2,"columnArticles":96,"formTitle":"[1363]形成三的最大倍数","frequency":1.7051051014,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":12836,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6755526657997399,"acs":3117,"articleLive":2,"columnArticles":60,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.2768834642,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"","submitted":4614,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8249970380316733,"acs":83559,"articleLive":2,"columnArticles":1073,"formTitle":"[1365]有多少小于当前数字的数字","frequency":1.1969752486,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":101284,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5361156959836516,"acs":6821,"articleLive":2,"columnArticles":138,"formTitle":"[1366]通过投票对团队排名","frequency":0.8660803995,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":12723,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.4166145270462431,"acs":14649,"articleLive":2,"columnArticles":216,"formTitle":"[1367]二叉树中的列表","frequency":0.8058212079,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":35162,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5170488835244418,"acs":3427,"articleLive":2,"columnArticles":83,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":6628,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6072395961585816,"acs":2466,"articleLive":2,"columnArticles":39,"formTitle":"[1369]获取最近第二次的活动","frequency":0.3327171103,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"","submitted":4061,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7905049733481676,"acs":47605,"articleLive":2,"columnArticles":570,"formTitle":"[1370]上升下降字符串","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":60221,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5797729560451851,"acs":20735,"articleLive":2,"columnArticles":261,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":1.9925912299,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":35764,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5146738772010816,"acs":7804,"articleLive":2,"columnArticles":158,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.3327171103,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":15163,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.3961006602715834,"acs":6359,"articleLive":2,"columnArticles":149,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":1.1969752486,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":16054,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.738627223165609,"acs":16529,"articleLive":2,"columnArticles":221,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":22378,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5707840590607697,"acs":8350,"articleLive":2,"columnArticles":167,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":14629,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5039281705948373,"acs":7184,"articleLive":2,"columnArticles":149,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.2768834642,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":14256,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32516326695154396,"acs":4033,"articleLive":2,"columnArticles":128,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":12403,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8625520636122681,"acs":6834,"articleLive":2,"columnArticles":58,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"","submitted":7923,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8362592561777186,"acs":10051,"articleLive":2,"columnArticles":155,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12019,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7274202271498107,"acs":16140,"articleLive":2,"columnArticles":243,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":22188,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7321452058398,"acs":11133,"articleLive":2,"columnArticles":140,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":15206,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6896438211863849,"acs":10475,"articleLive":2,"columnArticles":165,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.3327171103,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":15189,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.32273057371096586,"acs":4444,"articleLive":2,"columnArticles":86,"formTitle":"[1383]最大的团队表现值","frequency":0.4610570293,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":13770,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5416542251418334,"acs":1814,"articleLive":2,"columnArticles":43,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"","submitted":3349,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7034018814263837,"acs":12861,"articleLive":2,"columnArticles":191,"formTitle":"[1385]两个数组间的距离值","frequency":0.2768834642,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":18284,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.30988326848249026,"acs":5973,"articleLive":2,"columnArticles":123,"formTitle":"[1386]安排电影院座位","frequency":0.966163858,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":19275,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6945096887844979,"acs":9462,"articleLive":2,"columnArticles":167,"formTitle":"[1387]将整数按权重排序","frequency":0.9313777419,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":13624,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5353673553153646,"acs":3913,"articleLive":2,"columnArticles":51,"formTitle":"[1388]3n 块披萨","frequency":2.7727453908,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7309,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8306456465491305,"acs":27609,"articleLive":2,"columnArticles":471,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.8353654542,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":33238,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.350223290965304,"acs":6117,"articleLive":2,"columnArticles":113,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":17466,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.3991669774959592,"acs":6421,"articleLive":2,"columnArticles":199,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.966163858,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":16086,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.39771968854282536,"acs":7151,"articleLive":2,"columnArticles":128,"formTitle":"[1392]最长快乐前缀","frequency":0.2768834642,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":17980,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8566914917625819,"acs":3796,"articleLive":2,"columnArticles":56,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"","submitted":4431,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.664128629865133,"acs":16398,"articleLive":2,"columnArticles":262,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":24691,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7545618938024001,"acs":13770,"articleLive":2,"columnArticles":207,"formTitle":"[1395]统计作战单位数","frequency":0.2768834642,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":18249,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.4155033589022821,"acs":8721,"articleLive":2,"columnArticles":130,"formTitle":"[1396]设计地铁系统","frequency":0.966163858,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":20989,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3652762119503946,"acs":972,"articleLive":2,"columnArticles":35,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2661,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7726928895612708,"acs":4086,"articleLive":2,"columnArticles":60,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"","submitted":5288,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6666169784601624,"acs":8944,"articleLive":2,"columnArticles":147,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":13417,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.603510758776897,"acs":5329,"articleLive":2,"columnArticles":87,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.2768834642,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"","submitted":8830,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41496523562520693,"acs":3760,"articleLive":2,"columnArticles":87,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.3327171103,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9061,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.750732421875,"acs":9225,"articleLive":2,"columnArticles":167,"formTitle":"[1402]做菜顺序","frequency":0.3041926436,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":12288,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6912361964219783,"acs":20594,"articleLive":2,"columnArticles":350,"formTitle":"[1403]非递增顺序的最小子序列","frequency":0.7773697867,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":29793,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.49124649859943975,"acs":7015,"articleLive":2,"columnArticles":150,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.3625522588,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":14280,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5057612391386476,"acs":5355,"articleLive":2,"columnArticles":134,"formTitle":"[1405]最长快乐字符串","frequency":0.8660803995,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":10588,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5683040078201369,"acs":4651,"articleLive":2,"columnArticles":78,"formTitle":"[1406]石子游戏 III","frequency":0.2768834642,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8184,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6673083864757551,"acs":5546,"articleLive":2,"columnArticles":64,"formTitle":"[1407]排名靠前的旅行者","frequency":0.8058212079,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"","submitted":8311,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6135216952573158,"acs":12768,"articleLive":2,"columnArticles":196,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":20811,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.805314256515074,"acs":7880,"articleLive":2,"columnArticles":128,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":9785,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.4769674333267807,"acs":7279,"articleLive":2,"columnArticles":116,"formTitle":"[1410]HTML 实体解析器","frequency":0.3938048023,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":15261,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5488677867056245,"acs":7514,"articleLive":2,"columnArticles":139,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":3.923893934,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":13690,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5544188071397474,"acs":2547,"articleLive":2,"columnArticles":61,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"","submitted":4594,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6912765240821825,"acs":10262,"articleLive":2,"columnArticles":208,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.8660803995,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":14845,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6019614474129185,"acs":7120,"articleLive":2,"columnArticles":143,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":11828,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6840128755364807,"acs":6375,"articleLive":2,"columnArticles":170,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.2507039587,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":9320,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.4076923076923077,"acs":2703,"articleLive":2,"columnArticles":47,"formTitle":"[1416]恢复数组","frequency":1.3148973373,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":6630,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5188079305041773,"acs":12482,"articleLive":2,"columnArticles":180,"formTitle":"[1417]重新格式化字符串","frequency":0.2255770086,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":24059,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7334115089806659,"acs":25643,"articleLive":2,"columnArticles":412,"formTitle":"[1418]点菜展示表","frequency":2.4067736718,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":34964,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.41761765025540704,"acs":7685,"articleLive":2,"columnArticles":148,"formTitle":"[1419]数青蛙","frequency":1.2623366327,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":18402,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5922084492790286,"acs":2341,"articleLive":2,"columnArticles":42,"formTitle":"[1420]生成数组","frequency":1.2128460785,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":3953,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7496352494893492,"acs":2569,"articleLive":2,"columnArticles":32,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"","submitted":3427,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5404018811457888,"acs":10112,"articleLive":2,"columnArticles":186,"formTitle":"[1422]分割字符串的最大得分","frequency":1.4308011549,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":18712,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5546323155841815,"acs":33842,"articleLive":2,"columnArticles":500,"formTitle":"[1423]可获得的最大点数","frequency":0.8058212079,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":61017,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.3960241789742631,"acs":6355,"articleLive":2,"columnArticles":133,"formTitle":"[1424]对角线遍历 II","frequency":0.8660803995,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":16047,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.43367273770256703,"acs":3024,"articleLive":2,"columnArticles":66,"formTitle":"[1425]带限制的子序列和","frequency":0.3041926436,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":6973,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7011128775834659,"acs":1323,"articleLive":2,"columnArticles":44,"formTitle":"[1426]数元素","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"","submitted":1887,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6581939799331104,"acs":984,"articleLive":2,"columnArticles":42,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"","submitted":1495,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5916095890410958,"acs":691,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"","submitted":1168,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5080291970802919,"acs":1044,"articleLive":2,"columnArticles":35,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"","submitted":2055,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.57548032936871,"acs":629,"articleLive":2,"columnArticles":25,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"","submitted":1093,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.846117734398882,"acs":77501,"articleLive":2,"columnArticles":1020,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.2768834642,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":91596,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.39210053859964095,"acs":4368,"articleLive":2,"columnArticles":96,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11140,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6409515340151178,"acs":5766,"articleLive":2,"columnArticles":98,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":8996,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.44621979734996103,"acs":2290,"articleLive":2,"columnArticles":44,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5132,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.623403911427186,"acs":3857,"articleLive":2,"columnArticles":45,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"","submitted":6187,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.7829547152891945,"acs":20955,"articleLive":2,"columnArticles":363,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"","submitted":26764,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5894362017804154,"acs":9932,"articleLive":2,"columnArticles":167,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.2768834642,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":16850,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.4818401573502695,"acs":32092,"articleLive":2,"columnArticles":458,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":1.5645561361,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":66603,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5604934366598133,"acs":3544,"articleLive":2,"columnArticles":55,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":6323,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6947633716045926,"acs":2481,"articleLive":2,"columnArticles":33,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"","submitted":3571,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6465903992821893,"acs":17295,"articleLive":2,"columnArticles":356,"formTitle":"[1441]用栈操作构建数组","frequency":0.3327171103,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":26748,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7916359447004608,"acs":34357,"articleLive":2,"columnArticles":372,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":2.6274381477,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":43400,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.410590539319072,"acs":5451,"articleLive":2,"columnArticles":137,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":13276,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5236809306190279,"acs":2521,"articleLive":2,"columnArticles":60,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":4814,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8565764925373134,"acs":3673,"articleLive":2,"columnArticles":46,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"","submitted":4288,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5731249703130196,"acs":12066,"articleLive":2,"columnArticles":205,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":21053,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6168507688975525,"acs":5696,"articleLive":2,"columnArticles":68,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9234,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7130648096858432,"acs":9011,"articleLive":2,"columnArticles":141,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.2255770086,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":12637,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6275018388757694,"acs":16209,"articleLive":2,"columnArticles":206,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":1.7754180025,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":25831,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.80217761143246,"acs":23576,"articleLive":2,"columnArticles":336,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.8058212079,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":29390,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5207462206497266,"acs":9714,"articleLive":2,"columnArticles":149,"formTitle":"[1451]重新排列句子中的单词","frequency":0.3327171103,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":18654,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.49728705537852036,"acs":5774,"articleLive":2,"columnArticles":88,"formTitle":"[1452]收藏清单","frequency":0.4265946251,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":11611,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.3622891016871865,"acs":1589,"articleLive":2,"columnArticles":30,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4386,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.4027380642925223,"acs":4648,"articleLive":2,"columnArticles":75,"formTitle":"[1454]活跃用户","frequency":0.9313777419,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"","submitted":11541,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6340792874030902,"acs":11532,"articleLive":2,"columnArticles":193,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":18187,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.51767098906687,"acs":12216,"articleLive":2,"columnArticles":190,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":23598,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6368944814540669,"acs":7744,"articleLive":2,"columnArticles":134,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":12159,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4401286690792119,"acs":5473,"articleLive":2,"columnArticles":85,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12435,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5949152542372881,"acs":2106,"articleLive":2,"columnArticles":45,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"","submitted":3540,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7436648157496214,"acs":14732,"articleLive":2,"columnArticles":305,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":19810,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.49946294307196565,"acs":5580,"articleLive":2,"columnArticles":79,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":11172,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.42541106128550077,"acs":5692,"articleLive":2,"columnArticles":118,"formTitle":"[1462]课程表 IV","frequency":0.2768834642,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":13380,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.58803457688808,"acs":2585,"articleLive":2,"columnArticles":62,"formTitle":"[1463]摘樱桃 II","frequency":0.532340412,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4396,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7675790110388628,"acs":25380,"articleLive":2,"columnArticles":358,"formTitle":"[1464]数组中两元素的最大乘积","frequency":0.2768834642,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":33065,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.30742191423119414,"acs":6122,"articleLive":2,"columnArticles":77,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":19914,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.4833240468041073,"acs":6072,"articleLive":2,"columnArticles":120,"formTitle":"[1466]重新规划路线","frequency":0.8660803995,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":12563,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6111325860069579,"acs":1581,"articleLive":2,"columnArticles":45,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2587,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7146936656282451,"acs":2753,"articleLive":2,"columnArticles":47,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"","submitted":3852,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.8029480217222653,"acs":2070,"articleLive":2,"columnArticles":77,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"","submitted":2578,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8434164845055934,"acs":52474,"articleLive":2,"columnArticles":718,"formTitle":"[1470]重新排列数组","frequency":2.0568559182,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":62216,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5409391932570741,"acs":7188,"articleLive":2,"columnArticles":101,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13288,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6162250516173434,"acs":7163,"articleLive":2,"columnArticles":121,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":11624,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6754838425252392,"acs":15322,"articleLive":2,"columnArticles":163,"formTitle":"[1473]粉刷房子 III","frequency":2.2647208893,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":22683,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7191506410256411,"acs":1795,"articleLive":2,"columnArticles":59,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"","submitted":2496,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7240904517290685,"acs":13673,"articleLive":2,"columnArticles":218,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":18883,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8657154846831725,"acs":12378,"articleLive":2,"columnArticles":111,"formTitle":"[1476]子矩形查询","frequency":0.8660803995,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14298,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.29008773567295126,"acs":4662,"articleLive":2,"columnArticles":95,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.966163858,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":16071,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5697940503432495,"acs":2490,"articleLive":2,"columnArticles":55,"formTitle":"[1478]安排邮筒","frequency":1.4103714351,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4370,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5768857235351247,"acs":1782,"articleLive":2,"columnArticles":36,"formTitle":"[1479]周内每天的销售情况","frequency":0.4265946251,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"","submitted":3089,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8544033971701438,"acs":101809,"articleLive":2,"columnArticles":1071,"formTitle":"[1480]一维数组的动态和","frequency":3.0002472928,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"","submitted":119158,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.513493091537133,"acs":9514,"articleLive":2,"columnArticles":137,"formTitle":"[1481]不同整数的最少数目","frequency":0.8353654542,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":18528,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5869719866951222,"acs":30529,"articleLive":2,"columnArticles":397,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":2.4817853945,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":52011,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.30050577345166524,"acs":3149,"articleLive":2,"columnArticles":67,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":10479,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8030467899891186,"acs":738,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"","submitted":919,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6624785836664763,"acs":3480,"articleLive":2,"columnArticles":43,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"","submitted":5253,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.858532229059369,"acs":70179,"articleLive":2,"columnArticles":673,"formTitle":"[1486]数组异或操作","frequency":2.3372602337,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":81743,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.30748530264138446,"acs":7427,"articleLive":2,"columnArticles":99,"formTitle":"[1487]保证文件名唯一","frequency":1.229022426,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":24154,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.23454048513836692,"acs":6865,"articleLive":2,"columnArticles":107,"formTitle":"[1488]避免洪水泛滥","frequency":2.879087192,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":29270,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6933227925079056,"acs":11401,"articleLive":2,"columnArticles":124,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16444,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8556782334384858,"acs":1085,"articleLive":2,"columnArticles":28,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"","submitted":1268,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6709713254183156,"acs":19328,"articleLive":2,"columnArticles":291,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":28806,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6665585468699319,"acs":6165,"articleLive":2,"columnArticles":74,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":9249,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5662082200543739,"acs":7081,"articleLive":2,"columnArticles":136,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":1.1363444987,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":12506,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.36,"acs":2034,"articleLive":2,"columnArticles":33,"formTitle":"[1494]并行课程 II","frequency":1.3331626853,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":5650,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5432263814616756,"acs":3657,"articleLive":2,"columnArticles":37,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"","submitted":6732,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5384854449393971,"acs":10396,"articleLive":2,"columnArticles":157,"formTitle":"[1496]判断路径是否相交","frequency":0.2255770086,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":19306,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.3923057324840764,"acs":7699,"articleLive":2,"columnArticles":105,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":19625,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.3318672530987605,"acs":4980,"articleLive":2,"columnArticles":62,"formTitle":"[1498]满足条件的子序列数目","frequency":0.8660803995,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":15006,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.37784772182254195,"acs":2521,"articleLive":2,"columnArticles":56,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":6672,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.29387331256490135,"acs":566,"articleLive":2,"columnArticles":25,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"","submitted":1926,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5932283464566929,"acs":3767,"articleLive":2,"columnArticles":55,"formTitle":"[1501]可以放心投资的国家","frequency":1.1661086006,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"","submitted":6350,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7180910099889012,"acs":24586,"articleLive":2,"columnArticles":295,"formTitle":"[1502]判断能否形成等差数列","frequency":1.4308011549,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":34238,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5116696588868941,"acs":8265,"articleLive":2,"columnArticles":79,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.8980524322,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":16153,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5929783302536537,"acs":7060,"articleLive":2,"columnArticles":126,"formTitle":"[1504]统计全 1 子矩形","frequency":1.6398929527,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":11906,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.3574338085539715,"acs":3159,"articleLive":2,"columnArticles":71,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":1.7221761885,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":8838,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8388704318936877,"acs":505,"articleLive":2,"columnArticles":15,"formTitle":"[1506]找到 N 叉树的根节点","frequency":1.4951320132,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"","submitted":602,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5901196449247395,"acs":9174,"articleLive":2,"columnArticles":125,"formTitle":"[1507]转变日期格式","frequency":1.4623744168,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":15546,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5515157238643875,"acs":5840,"articleLive":2,"columnArticles":48,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.3041926436,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":10589,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5445636957536164,"acs":4668,"articleLive":2,"columnArticles":71,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":8572,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5771125893077113,"acs":4685,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":0.8058212079,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":8118,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6840296617833242,"acs":3782,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":0.2768834642,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"","submitted":5529,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8484521769953329,"acs":57447,"articleLive":2,"columnArticles":731,"formTitle":"[1512]好数对的数目","frequency":0.2768834642,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":67708,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.37783941298318297,"acs":10762,"articleLive":2,"columnArticles":146,"formTitle":"[1513]仅含 1 的子串数","frequency":0.3041926436,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":28483,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.31498875512633945,"acs":7143,"articleLive":2,"columnArticles":128,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":22677,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34049623393885686,"acs":3074,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.6492521472,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9028,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5369318181818182,"acs":189,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"","submitted":352,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7286803790154842,"acs":3153,"articleLive":2,"columnArticles":35,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"","submitted":4327,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6752315929629734,"acs":23835,"articleLive":2,"columnArticles":386,"formTitle":"[1518]换酒问题","frequency":1.1661086006,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":35299,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.2950124001102232,"acs":5353,"articleLive":2,"columnArticles":121,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18145,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.3293559322033898,"acs":2429,"articleLive":2,"columnArticles":70,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7375,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.3957078894549946,"acs":2563,"articleLive":2,"columnArticles":50,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.7499407495,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6477,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7107728337236534,"acs":607,"articleLive":2,"columnArticles":22,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"","submitted":854,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5776545166402536,"acs":9477,"articleLive":2,"columnArticles":163,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":16406,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.4224907063197026,"acs":4546,"articleLive":2,"columnArticles":96,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.8353654542,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":10760,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6597321544662592,"acs":5074,"articleLive":2,"columnArticles":107,"formTitle":"[1525]字符串的好分割数目","frequency":0.3041926436,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":7691,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.611682435211847,"acs":2974,"articleLive":2,"columnArticles":46,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":4862,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5094688221709007,"acs":3309,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"","submitted":6495,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7840161182001343,"acs":29185,"articleLive":2,"columnArticles":347,"formTitle":"[1528]重新排列字符串","frequency":0.7773697867,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":37225,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6886792452830188,"acs":8687,"articleLive":2,"columnArticles":130,"formTitle":"[1529]灯泡开关 IV","frequency":0.2768834642,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":12614,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.565528781793842,"acs":8449,"articleLive":2,"columnArticles":143,"formTitle":"[1530]好叶子节点对的数量","frequency":0.966163858,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":14940,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.32206178029610677,"acs":1762,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":1.1218535916,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5471,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6207332490518331,"acs":2455,"articleLive":2,"columnArticles":45,"formTitle":"[1532]最近的三笔订单","frequency":0.0,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"","submitted":3955,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6093023255813953,"acs":262,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"","submitted":430,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7883000427005741,"acs":16615,"articleLive":2,"columnArticles":156,"formTitle":"[1534]统计好三元组","frequency":0.2507039587,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":21077,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.4523975224441506,"acs":13001,"articleLive":2,"columnArticles":176,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.3625522588,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":28738,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4378769601930036,"acs":3993,"articleLive":2,"columnArticles":75,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9119,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.3649839064882263,"acs":4309,"articleLive":2,"columnArticles":86,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":11806,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.5956284153005464,"acs":109,"articleLive":2,"columnArticles":6,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"","submitted":183,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5379969096783256,"acs":15320,"articleLive":2,"columnArticles":227,"formTitle":"[1539]第 k 个缺失的正整数","frequency":2.76335124,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":28476,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3153219837157661,"acs":4686,"articleLive":2,"columnArticles":83,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":14861,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.45672799273987297,"acs":5536,"articleLive":2,"columnArticles":89,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":12121,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.37849117174959873,"acs":2358,"articleLive":2,"columnArticles":46,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6230,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5487680716758297,"acs":2695,"articleLive":2,"columnArticles":42,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"","submitted":4911,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5429190836116482,"acs":18532,"articleLive":2,"columnArticles":303,"formTitle":"[1544]整理字符串","frequency":1.1661086006,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":34134,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5522194208877683,"acs":7228,"articleLive":2,"columnArticles":99,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":0.3625522588,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13089,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.4083991683991684,"acs":4911,"articleLive":2,"columnArticles":74,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12025,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.531529056189037,"acs":3869,"articleLive":2,"columnArticles":68,"formTitle":"[1547]切棍子的最小成本","frequency":1.3709030133,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7279,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7108695652173913,"acs":327,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"","submitted":460,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6656760772659732,"acs":2240,"articleLive":2,"columnArticles":43,"formTitle":"[1549]每件商品的最新订单","frequency":0.3041926436,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"","submitted":3365,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6599858902001026,"acs":20581,"articleLive":2,"columnArticles":279,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.2768834642,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":31184,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8173033368564094,"acs":10826,"articleLive":2,"columnArticles":146,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.2768834642,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":13246,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5059593362935265,"acs":8660,"articleLive":2,"columnArticles":120,"formTitle":"[1552]两球之间的磁力","frequency":0.3041926436,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":17116,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.29323337936476623,"acs":7432,"articleLive":2,"columnArticles":119,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":2.8228926337,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":25345,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.6992481203007519,"acs":465,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"","submitted":665,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.43618167821401077,"acs":2833,"articleLive":2,"columnArticles":53,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"","submitted":6495,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5795087638376384,"acs":10051,"articleLive":2,"columnArticles":153,"formTitle":"[1556]千位分隔数","frequency":2.2022005323,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":17344,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7607401796342387,"acs":7030,"articleLive":2,"columnArticles":93,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":9241,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6207986210858949,"acs":4322,"articleLive":2,"columnArticles":67,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.4610570293,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":6962,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.3651006711409396,"acs":3264,"articleLive":2,"columnArticles":59,"formTitle":"[1559]二维网格图中探测环","frequency":0.532340412,"frontendQuestionId":"1559","leaf":true,"level":3,"nodeType":"def","questionId":"1663","status":"","submitted":8940,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5734870317002881,"acs":8358,"articleLive":2,"columnArticles":88,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.3327171103,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":14574,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7790285595163644,"acs":11211,"articleLive":2,"columnArticles":150,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":0.8353654542,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":14391,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.30910305910305913,"acs":4163,"articleLive":2,"columnArticles":82,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.532340412,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13468,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.3763004062221342,"acs":3798,"articleLive":2,"columnArticles":65,"formTitle":"[1563]石子游戏 V","frequency":2.1355091578,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10093,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5854870775347912,"acs":589,"articleLive":2,"columnArticles":22,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"","submitted":1006,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.725451397477121,"acs":2933,"articleLive":2,"columnArticles":39,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.2768834642,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"","submitted":4043,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4455131964809384,"acs":7596,"articleLive":2,"columnArticles":114,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.2768834642,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":17050,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.3888085897171175,"acs":9415,"articleLive":2,"columnArticles":167,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":0.7499407495,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":24215,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.45371050698016163,"acs":2470,"articleLive":2,"columnArticles":45,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5444,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.47213658999288594,"acs":1991,"articleLive":2,"columnArticles":44,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4217,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8990033222591363,"acs":1353,"articleLive":2,"columnArticles":33,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"","submitted":1505,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7578162578162578,"acs":3151,"articleLive":2,"columnArticles":42,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"","submitted":4158,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8048120169424916,"acs":18431,"articleLive":2,"columnArticles":312,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.1782084566,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":22901,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.29552341597796145,"acs":4291,"articleLive":2,"columnArticles":59,"formTitle":"[1573]分割字符串的方案数","frequency":0.3041926436,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":14520,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3258735200693041,"acs":4514,"articleLive":2,"columnArticles":76,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":1.7051051014,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":13852,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.6017344896597732,"acs":3608,"articleLive":2,"columnArticles":60,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":5996,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.47637071779258894,"acs":17368,"articleLive":2,"columnArticles":244,"formTitle":"[1576]替换所有的问号","frequency":0.3041926436,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":36459,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.3233019174520637,"acs":4974,"articleLive":2,"columnArticles":78,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.4265946251,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15385,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5791802643951546,"acs":10471,"articleLive":2,"columnArticles":197,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":18079,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6197155735156978,"acs":15949,"articleLive":2,"columnArticles":293,"formTitle":"[1579]保证图可完全遍历","frequency":1.2128460785,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":25736,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6282722513089005,"acs":240,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"","submitted":382,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8144382308083375,"acs":3204,"articleLive":2,"columnArticles":44,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"","submitted":3934,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6711091690335736,"acs":9215,"articleLive":2,"columnArticles":106,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.2768834642,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":13731,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6848680991984345,"acs":18199,"articleLive":2,"columnArticles":240,"formTitle":"[1583]统计不开心的朋友","frequency":1.2934820963,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":26573,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6669441013800139,"acs":24841,"articleLive":2,"columnArticles":318,"formTitle":"[1584]连接所有点的最小费用","frequency":0.0,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":37246,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4296022201665125,"acs":2322,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5405,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6261343012704175,"acs":345,"articleLive":2,"columnArticles":21,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"","submitted":551,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8252807521546096,"acs":3160,"articleLive":2,"columnArticles":40,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"","submitted":3829,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8018267691947383,"acs":20542,"articleLive":2,"columnArticles":384,"formTitle":"[1588]所有奇数长度子数组的和","frequency":0.8353654542,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"","submitted":25619,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2947298860069387,"acs":3568,"articleLive":2,"columnArticles":51,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":12106,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.26369545032497677,"acs":3408,"articleLive":2,"columnArticles":54,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.4610570293,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":12924,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.575973669775096,"acs":1050,"articleLive":2,"columnArticles":30,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":1823,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.4451686885146961,"acs":7376,"articleLive":2,"columnArticles":118,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":16569,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5265171094799959,"acs":5093,"articleLive":2,"columnArticles":87,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.2768834642,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":9673,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3125922473393925,"acs":4024,"articleLive":2,"columnArticles":98,"formTitle":"[1594]矩阵的最大非负积","frequency":0.3327171103,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":12873,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.461226558540294,"acs":1820,"articleLive":2,"columnArticles":37,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":3946,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7630397236614853,"acs":2209,"articleLive":2,"columnArticles":37,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"","submitted":2895,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6548223350253807,"acs":258,"articleLive":2,"columnArticles":18,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"","submitted":394,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6705165630156111,"acs":10566,"articleLive":2,"columnArticles":145,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.2768834642,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":15758,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.418899388549194,"acs":3768,"articleLive":2,"columnArticles":67,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":8995,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.683558419031099,"acs":16551,"articleLive":2,"columnArticles":203,"formTitle":"[1600]皇位继承顺序","frequency":0.8660803995,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":24213,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.4804295942720764,"acs":2013,"articleLive":2,"columnArticles":39,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4190,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7802746566791511,"acs":625,"articleLive":2,"columnArticles":27,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"","submitted":801,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.844926592021333,"acs":55766,"articleLive":2,"columnArticles":446,"formTitle":"[1603]设计停车系统","frequency":2.9828070182,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":66001,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.41375291375291373,"acs":3550,"articleLive":2,"columnArticles":59,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":8580,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7348345588235294,"acs":3198,"articleLive":2,"columnArticles":64,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"","submitted":4352,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.34025974025974026,"acs":1572,"articleLive":2,"columnArticles":32,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4620,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5515202702702703,"acs":2612,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"","submitted":4736,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.639275670484944,"acs":9320,"articleLive":2,"columnArticles":150,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":14579,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5117607274366874,"acs":6810,"articleLive":2,"columnArticles":115,"formTitle":"[1609]奇偶树","frequency":0.2768834642,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":13307,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.2701006512729426,"acs":2281,"articleLive":2,"columnArticles":38,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8445,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6077844311377245,"acs":2030,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3340,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7357142857142858,"acs":412,"articleLive":2,"columnArticles":19,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"","submitted":560,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7272293752980449,"acs":1525,"articleLive":2,"columnArticles":35,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"","submitted":2097,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8201471941122355,"acs":16047,"articleLive":2,"columnArticles":270,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.2507039587,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":19566,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.4948063294825745,"acs":5097,"articleLive":2,"columnArticles":62,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":10301,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.2749745446317457,"acs":4861,"articleLive":2,"columnArticles":90,"formTitle":"[1616]分割两个字符串得到回文串","frequency":0.3625522588,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":17678,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6180478821362799,"acs":1678,"articleLive":2,"columnArticles":31,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2715,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5894308943089431,"acs":290,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"","submitted":492,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6784317559640204,"acs":6939,"articleLive":2,"columnArticles":124,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":10228,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3671125098347758,"acs":2333,"articleLive":2,"columnArticles":39,"formTitle":"[1620]网络信号最好的坐标","frequency":0.532340412,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6355,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.43452380952380953,"acs":1679,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":3864,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.145315117927568,"acs":2255,"articleLive":2,"columnArticles":50,"formTitle":"[1622]奇妙序列","frequency":0.966163858,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":15518,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.783201189296333,"acs":3161,"articleLive":2,"columnArticles":42,"formTitle":"[1623]三人国家代表队","frequency":0.3041926436,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"","submitted":4036,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6274372853733776,"acs":10780,"articleLive":2,"columnArticles":183,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":0.8353654542,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":17181,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5394887447539107,"acs":2828,"articleLive":2,"columnArticles":63,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5242,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.3829371205104456,"acs":3721,"articleLive":2,"columnArticles":82,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.3327171103,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":9717,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.378915079108815,"acs":2347,"articleLive":2,"columnArticles":36,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6194,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8416075650118203,"acs":356,"articleLive":2,"columnArticles":17,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"","submitted":423,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5221309833767274,"acs":7821,"articleLive":2,"columnArticles":86,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":14979,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7694687433326222,"acs":7213,"articleLive":2,"columnArticles":110,"formTitle":"[1630]等差子数组","frequency":0.3041926436,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9374,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.49205026024723486,"acs":24201,"articleLive":2,"columnArticles":296,"formTitle":"[1631]最小体力消耗路径","frequency":1.229022426,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"","submitted":49184,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.31667038607453696,"acs":1419,"articleLive":2,"columnArticles":26,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4481,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6587131367292225,"acs":2457,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":0.3041926436,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"","submitted":3730,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5203804347826086,"acs":383,"articleLive":2,"columnArticles":23,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"","submitted":736,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5447800741918389,"acs":1028,"articleLive":2,"columnArticles":27,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.3327171103,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"","submitted":1887,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7069351230425056,"acs":8532,"articleLive":2,"columnArticles":168,"formTitle":"[1636]按照频率将数组升序排序","frequency":0.2768834642,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":12069,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8060453400503779,"acs":5120,"articleLive":2,"columnArticles":65,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6352,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7099761841757078,"acs":2683,"articleLive":2,"columnArticles":46,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":3779,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.4018629407850965,"acs":1208,"articleLive":2,"columnArticles":27,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3006,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6637856989478205,"acs":12365,"articleLive":2,"columnArticles":210,"formTitle":"[1640]能否连接形成数组","frequency":0.2768834642,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":18628,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7692911326183626,"acs":11764,"articleLive":2,"columnArticles":263,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":1.8450487545,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15292,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.4541546215995849,"acs":6127,"articleLive":2,"columnArticles":101,"formTitle":"[1642]可以到达的最远建筑","frequency":0.8353654542,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":13491,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.44944757139879093,"acs":2156,"articleLive":2,"columnArticles":47,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":4797,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5361726954492415,"acs":919,"articleLive":2,"columnArticles":19,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.8660803995,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"","submitted":1714,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.4216374269005848,"acs":721,"articleLive":2,"columnArticles":23,"formTitle":"[1645]Hopper Company Queries II","frequency":0.3327171103,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"","submitted":1710,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5119521912350598,"acs":6682,"articleLive":2,"columnArticles":97,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":1.1969752486,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":13052,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2782322678586489,"acs":3299,"articleLive":2,"columnArticles":85,"formTitle":"[1648]销售价值减少的颜色球","frequency":0.3625522588,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":11857,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.47469088098918083,"acs":2457,"articleLive":2,"columnArticles":61,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5176,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7948517940717629,"acs":1019,"articleLive":2,"columnArticles":25,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.3041926436,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"","submitted":1282,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.7027310924369747,"acs":669,"articleLive":2,"columnArticles":22,"formTitle":"[1651]Hopper Company Queries III","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"","submitted":952,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6595014633161772,"acs":6535,"articleLive":2,"columnArticles":167,"formTitle":"[1652]拆炸弹","frequency":0.8353654542,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":9909,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5007444907683145,"acs":3363,"articleLive":2,"columnArticles":80,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.3041926436,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":6716,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.27374784110535405,"acs":3170,"articleLive":2,"columnArticles":46,"formTitle":"[1654]到家的最少跳跃次数","frequency":1.1969752486,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":11580,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.3817068018588931,"acs":1807,"articleLive":2,"columnArticles":30,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":4734,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7801558441558442,"acs":7509,"articleLive":2,"columnArticles":88,"formTitle":"[1656]设计有序流","frequency":0.2768834642,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":9625,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46491843536221716,"acs":5301,"articleLive":2,"columnArticles":74,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.3041926436,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":11402,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.2953496755587599,"acs":8193,"articleLive":2,"columnArticles":145,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":27740,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.40582462804685027,"acs":1282,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":1.3148973373,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3159,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.741869918699187,"acs":365,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"","submitted":492,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7316498316498317,"acs":2173,"articleLive":2,"columnArticles":52,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.8660803995,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"","submitted":2970,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8136060581117788,"acs":19769,"articleLive":2,"columnArticles":269,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.8058212079,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":24298,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5713509316770187,"acs":7359,"articleLive":2,"columnArticles":127,"formTitle":"[1663]具有给定数值的最小字符串","frequency":1.229022426,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":12880,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5444998960282803,"acs":5237,"articleLive":2,"columnArticles":104,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":9618,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6673765473179821,"acs":5014,"articleLive":2,"columnArticles":77,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.3327171103,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":7513,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.680379746835443,"acs":215,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"","submitted":316,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6064959400374765,"acs":1942,"articleLive":2,"columnArticles":31,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"","submitted":3202,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.44127480970335065,"acs":6203,"articleLive":2,"columnArticles":122,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":14057,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.768872010127257,"acs":11540,"articleLive":2,"columnArticles":211,"formTitle":"[1669]合并两个链表","frequency":0.8058212079,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":15009,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5274754446509159,"acs":3974,"articleLive":2,"columnArticles":75,"formTitle":"[1670]设计前中后队列","frequency":0.3327171103,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":7534,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.4652575315840622,"acs":1915,"articleLive":2,"columnArticles":35,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.6036237946,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4116,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8502631519504867,"acs":37642,"articleLive":2,"columnArticles":433,"formTitle":"[1672]最富有客户的资产总量","frequency":0.2768834642,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":44271,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.350782541071255,"acs":7217,"articleLive":2,"columnArticles":162,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.3041926436,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":20574,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.35898212662829443,"acs":2370,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":1.0018055493,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6602,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4355926188786373,"acs":2455,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":5636,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7653061224489796,"acs":675,"articleLive":2,"columnArticles":19,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.4966987206,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"","submitted":882,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.40549273021001614,"acs":1757,"articleLive":2,"columnArticles":30,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"","submitted":4333,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8296660117878193,"acs":16892,"articleLive":2,"columnArticles":270,"formTitle":"[1678]设计 Goal 解析器","frequency":0.2768834642,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":20360,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.494142228191926,"acs":6622,"articleLive":2,"columnArticles":106,"formTitle":"[1679]K 和数对的最大数目","frequency":0.3041926436,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":13401,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4610406878822799,"acs":5201,"articleLive":2,"columnArticles":70,"formTitle":"[1680]连接连续二进制数字","frequency":0.2768834642,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11281,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.3802294197031039,"acs":2254,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.6036237946,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":5928,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5335892514395394,"acs":278,"articleLive":2,"columnArticles":13,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"","submitted":521,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8952002272081795,"acs":3152,"articleLive":2,"columnArticles":35,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"","submitted":3521,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8275341967025537,"acs":15911,"articleLive":2,"columnArticles":336,"formTitle":"[1684]统计一致字符串的数目","frequency":1.1661086006,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":19227,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5941176470588235,"acs":3434,"articleLive":2,"columnArticles":79,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":5780,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.4679462571976967,"acs":2438,"articleLive":2,"columnArticles":47,"formTitle":"[1686]石子游戏 VI","frequency":0.3327171103,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5210,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.3997308209959623,"acs":891,"articleLive":2,"columnArticles":19,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2229,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8037532609610368,"acs":19102,"articleLive":2,"columnArticles":250,"formTitle":"[1688]比赛中的配对次数","frequency":0.8058212079,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":23766,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8690105787181083,"acs":13965,"articleLive":2,"columnArticles":181,"formTitle":"[1689]十-二进制数的最少数目","frequency":1.1661086006,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":16070,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5094668659691082,"acs":4090,"articleLive":2,"columnArticles":103,"formTitle":"[1690]石子游戏 VII","frequency":0.3327171103,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8028,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.4849052675411201,"acs":2329,"articleLive":2,"columnArticles":62,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":4803,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6538461538461539,"acs":153,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"","submitted":234,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8060362173038229,"acs":2003,"articleLive":2,"columnArticles":32,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"","submitted":2485,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6366024518388792,"acs":7270,"articleLive":2,"columnArticles":132,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":11420,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.45321730799936133,"acs":5677,"articleLive":2,"columnArticles":125,"formTitle":"[1695]删除子数组的最大得分","frequency":0.2768834642,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":12526,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.4000138150169234,"acs":5791,"articleLive":2,"columnArticles":107,"formTitle":"[1696]跳跃游戏 VI","frequency":1.1661086006,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":14477,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.52453300124533,"acs":2106,"articleLive":2,"columnArticles":42,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4015,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5438144329896907,"acs":422,"articleLive":2,"columnArticles":16,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"","submitted":776,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.8001038421599169,"acs":1541,"articleLive":2,"columnArticles":39,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"","submitted":1926,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7194956757319996,"acs":6905,"articleLive":2,"columnArticles":165,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.2768834642,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":9597,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6104330379535194,"acs":3651,"articleLive":2,"columnArticles":75,"formTitle":"[1701]平均等待时间","frequency":0.8660803995,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":5981,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.47571801566579636,"acs":2733,"articleLive":2,"columnArticles":65,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.9313777419,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":5745,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3889240506329114,"acs":1229,"articleLive":2,"columnArticles":22,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3160,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7813362039965014,"acs":11613,"articleLive":2,"columnArticles":175,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":14863,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.3462217736848745,"acs":5489,"articleLive":2,"columnArticles":114,"formTitle":"[1705]吃苹果的最大数目","frequency":0.8660803995,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":15854,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5849002849002849,"acs":4106,"articleLive":2,"columnArticles":106,"formTitle":"[1706]球会落何处","frequency":0.8980524322,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7020,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5033776500179662,"acs":14009,"articleLive":2,"columnArticles":147,"formTitle":"[1707]与数组中元素的最大异或值","frequency":2.0672656307,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":27830,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.664396887159533,"acs":683,"articleLive":2,"columnArticles":23,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"","submitted":1028,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7170129140932061,"acs":1277,"articleLive":2,"columnArticles":34,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"","submitted":1781,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6923773780251068,"acs":10700,"articleLive":2,"columnArticles":175,"formTitle":"[1710]卡车上的最大单元数","frequency":1.1969752486,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"","submitted":15454,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.35923384032711353,"acs":29783,"articleLive":2,"columnArticles":357,"formTitle":"[1711]大餐计数","frequency":2.4996909759,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":82907,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.26560146085368636,"acs":5818,"articleLive":2,"columnArticles":101,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":21905,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.4973379368203672,"acs":15413,"articleLive":2,"columnArticles":171,"formTitle":"[1713]得到子序列的最少操作次数","frequency":1.1762712897,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":30991,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6342857142857142,"acs":222,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"","submitted":350,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7370820668693009,"acs":1455,"articleLive":2,"columnArticles":33,"formTitle":"[1715]苹果和橘子的个数","frequency":0.8660803995,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"","submitted":1974,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6748884807137234,"acs":7716,"articleLive":2,"columnArticles":182,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":11433,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.43122521394280944,"acs":2066,"articleLive":2,"columnArticles":48,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":4791,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.48623853211009177,"acs":1855,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":3815,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.3614013521819299,"acs":588,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1627,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8693007963205808,"acs":45740,"articleLive":2,"columnArticles":481,"formTitle":"[1720]解码异或后的数组","frequency":2.76335124,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":52617,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6494489010630666,"acs":9958,"articleLive":2,"columnArticles":157,"formTitle":"[1721]交换链表中的节点","frequency":0.3041926436,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":15333,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5132949257699978,"acs":4633,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9026,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5078901227352426,"acs":22594,"articleLive":2,"columnArticles":175,"formTitle":"[1723]完成所有工作的最短时间","frequency":3.5822027378,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":44486,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5536332179930796,"acs":320,"articleLive":2,"columnArticles":10,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"","submitted":578,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.786817556201254,"acs":10290,"articleLive":2,"columnArticles":137,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.2768834642,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":13078,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.4749330954504906,"acs":5324,"articleLive":2,"columnArticles":106,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11210,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5727131246757738,"acs":3312,"articleLive":2,"columnArticles":82,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.532340412,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":5783,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3480905711388983,"acs":1030,"articleLive":2,"columnArticles":24,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":2959,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6249162759544541,"acs":1866,"articleLive":2,"columnArticles":21,"formTitle":"[1729]求关注者的数量","frequency":0.3041926436,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"","submitted":2986,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5354416575790621,"acs":491,"articleLive":2,"columnArticles":21,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"","submitted":917,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.47714371078577833,"acs":1597,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"","submitted":3347,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7929852132295164,"acs":11101,"articleLive":2,"columnArticles":192,"formTitle":"[1732]找到最高海拔","frequency":1.5291604751,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":13999,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4576502732240437,"acs":2010,"articleLive":2,"columnArticles":55,"formTitle":"[1733]需要教语言的最少人数","frequency":0.5679821033,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4392,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7232900974110538,"acs":27770,"articleLive":2,"columnArticles":367,"formTitle":"[1734]解码异或后的排列","frequency":2.7000389606,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38394,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.4844844844844845,"acs":968,"articleLive":2,"columnArticles":24,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":1998,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4491451012947205,"acs":28134,"articleLive":2,"columnArticles":349,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":2.1704854006,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":62639,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.3078558143654238,"acs":3476,"articleLive":2,"columnArticles":100,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":1.0018055493,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":11291,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6540365130503806,"acs":28015,"articleLive":2,"columnArticles":385,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":2.0976668046,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":42834,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4703845452888646,"acs":2581,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5487,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7002762430939227,"acs":507,"articleLive":2,"columnArticles":16,"formTitle":"[1740]找到二叉树中的距离","frequency":0.6036237946,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"","submitted":724,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8429319371727748,"acs":1771,"articleLive":2,"columnArticles":30,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"","submitted":2101,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7056550755180893,"acs":8036,"articleLive":2,"columnArticles":124,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.2768834642,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":11388,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6974609683015297,"acs":22113,"articleLive":2,"columnArticles":323,"formTitle":"[1743]从相邻元素对还原数组","frequency":0.8483808224,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":31705,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.36309693099257956,"acs":28087,"articleLive":2,"columnArticles":363,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":2.7000389606,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":77354,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.48450491307634164,"acs":3205,"articleLive":2,"columnArticles":70,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":6615,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.6091428571428571,"acs":533,"articleLive":2,"columnArticles":25,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"","submitted":875,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7031736154324829,"acs":1130,"articleLive":2,"columnArticles":32,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"","submitted":1607,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7494150336355659,"acs":10249,"articleLive":2,"columnArticles":213,"formTitle":"[1748]唯一元素的和","frequency":1.1969752486,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":13676,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5303244005641748,"acs":3384,"articleLive":2,"columnArticles":85,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":1.1969752486,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":6381,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.45898234683281414,"acs":3094,"articleLive":2,"columnArticles":78,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":6741,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.46792009400705054,"acs":1991,"articleLive":2,"columnArticles":32,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":1.1218535916,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":4255,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6868074273734651,"acs":9173,"articleLive":2,"columnArticles":109,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":13356,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6275685882483617,"acs":5650,"articleLive":2,"columnArticles":122,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":9003,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.42007746257720086,"acs":4013,"articleLive":2,"columnArticles":89,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.3327171103,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":9553,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.39651058753355206,"acs":2659,"articleLive":2,"columnArticles":49,"formTitle":"[1755]最接近目标值的子序列和","frequency":0.3041926436,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":6706,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.8121019108280255,"acs":255,"articleLive":2,"columnArticles":11,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"","submitted":314,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9239167519617878,"acs":2708,"articleLive":2,"columnArticles":30,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"","submitted":2931,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6350693143499438,"acs":6780,"articleLive":2,"columnArticles":108,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":10676,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.42744984006978776,"acs":4410,"articleLive":2,"columnArticles":92,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.2768834642,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":10317,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5360415811790453,"acs":3919,"articleLive":2,"columnArticles":75,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":7311,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.4278821299327934,"acs":2483,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":1.0398908834,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":5803,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.669449081803005,"acs":401,"articleLive":2,"columnArticles":17,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"","submitted":599,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6105616093880972,"acs":3642,"articleLive":2,"columnArticles":75,"formTitle":"[1763]最长的美好子字符串","frequency":0.3327171103,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":5965,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.47643979057591623,"acs":2184,"articleLive":2,"columnArticles":51,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":4584,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5651093439363817,"acs":3411,"articleLive":2,"columnArticles":80,"formTitle":"[1765]地图中的最高点","frequency":0.3327171103,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6036,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.375139353400223,"acs":1346,"articleLive":2,"columnArticles":25,"formTitle":"[1766]互质树","frequency":0.7499407495,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3588,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.8061224489795918,"acs":711,"articleLive":2,"columnArticles":19,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"","submitted":882,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7690136768217671,"acs":10627,"articleLive":2,"columnArticles":195,"formTitle":"[1768]交替合并字符串","frequency":1.1363444987,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":13819,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8549867608120035,"acs":9687,"articleLive":2,"columnArticles":163,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.2768834642,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":11330,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.36849365458892774,"acs":4007,"articleLive":2,"columnArticles":99,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.4966987206,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":10874,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36369540509823023,"acs":2240,"articleLive":2,"columnArticles":46,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6159,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5387673956262425,"acs":271,"articleLive":2,"columnArticles":10,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"","submitted":503,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8409165302782324,"acs":15414,"articleLive":2,"columnArticles":194,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":1.4308011549,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":18330,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5551382066840027,"acs":5764,"articleLive":2,"columnArticles":87,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.8660803995,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":10383,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.4720776968435657,"acs":4083,"articleLive":2,"columnArticles":87,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.8980524322,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":8649,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4634010576120234,"acs":1665,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":1.4103714351,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":3593,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7780216070222823,"acs":4609,"articleLive":2,"columnArticles":57,"formTitle":"[1777]每家商店的产品价格","frequency":3.3833338447,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"","submitted":5924,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5571955719557196,"acs":151,"articleLive":2,"columnArticles":8,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"","submitted":271,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6471479050984351,"acs":5128,"articleLive":2,"columnArticles":65,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.3041926436,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":7924,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6612594201047388,"acs":5177,"articleLive":2,"columnArticles":106,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":7829,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5156903765690377,"acs":3944,"articleLive":2,"columnArticles":56,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.2507039587,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":7648,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.2851415685291907,"acs":1138,"articleLive":2,"columnArticles":32,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":3991,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7928853754940711,"acs":1003,"articleLive":2,"columnArticles":25,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"","submitted":1265,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.42036981807336715,"acs":8457,"articleLive":2,"columnArticles":98,"formTitle":"[1784]检查二进制字符串字段","frequency":0.2768834642,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":20118,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.3471840080857993,"acs":6183,"articleLive":2,"columnArticles":61,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":17809,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.3392367699768079,"acs":3218,"articleLive":2,"columnArticles":83,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":9486,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6541105460235846,"acs":11704,"articleLive":2,"columnArticles":59,"formTitle":"[1787]使所有区间的异或结果为零","frequency":2.7000389606,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":17893,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.6796536796536796,"acs":157,"articleLive":2,"columnArticles":12,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"","submitted":231,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7180941576857629,"acs":1266,"articleLive":2,"columnArticles":27,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"","submitted":1763,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6519511437739365,"acs":12597,"articleLive":2,"columnArticles":135,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.2768834642,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":19322,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8097144382172404,"acs":9102,"articleLive":2,"columnArticles":123,"formTitle":"[1791]找出星型图的中心节点","frequency":0.2255770086,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":11241,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5136418511066398,"acs":6382,"articleLive":2,"columnArticles":103,"formTitle":"[1792]最大平均通过率","frequency":1.7395770104,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":12425,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.41100252552981226,"acs":3743,"articleLive":2,"columnArticles":89,"formTitle":"[1793]好子数组的最大分数","frequency":0.966163858,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9107,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.6822916666666666,"acs":131,"articleLive":2,"columnArticles":8,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"","submitted":192,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7909635274904736,"acs":1453,"articleLive":2,"columnArticles":26,"formTitle":"[1795]每个产品在不同商店的价格","frequency":1.2623366327,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"","submitted":1837,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.4865217037218014,"acs":5974,"articleLive":2,"columnArticles":113,"formTitle":"[1796]字符串中第二大的数字","frequency":0.2768834642,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":12279,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5728240268260679,"acs":3929,"articleLive":2,"columnArticles":60,"formTitle":"[1797]设计一个验证系统","frequency":0.8660803995,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":6859,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5180744452397996,"acs":2895,"articleLive":2,"columnArticles":46,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":5588,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5103596094308168,"acs":2143,"articleLive":2,"columnArticles":33,"formTitle":"[1799]N 次操作后的最大分数和","frequency":0.4265946251,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4199,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6835461835461836,"acs":9206,"articleLive":2,"columnArticles":148,"formTitle":"[1800]最大升序子数组和","frequency":0.8353654542,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":13468,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.37633898947767563,"acs":3970,"articleLive":2,"columnArticles":107,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":10549,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.2619569421167977,"acs":4064,"articleLive":2,"columnArticles":106,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":15514,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.4107825387246027,"acs":2042,"articleLive":2,"columnArticles":51,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":1.0798482563,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":4971,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5766773162939297,"acs":361,"articleLive":2,"columnArticles":25,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.6036237946,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"","submitted":626,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.4959498421124891,"acs":10837,"articleLive":2,"columnArticles":143,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.2507039587,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":21851,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6635440031666446,"acs":5029,"articleLive":2,"columnArticles":80,"formTitle":"[1806]还原排列的最少操作步数","frequency":1.2623366327,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7579,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5841573631047315,"acs":5494,"articleLive":2,"columnArticles":83,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":9405,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.26558839933073064,"acs":2381,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":0.6978998714,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":8965,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6390532544378699,"acs":1296,"articleLive":2,"columnArticles":28,"formTitle":"[1809]没有广告的剧集","frequency":0.8353654542,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"","submitted":2028,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6567164179104478,"acs":132,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":1.3709030133,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"","submitted":201,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6700819672131147,"acs":654,"articleLive":2,"columnArticles":22,"formTitle":"[1811]寻找面试候选人","frequency":0.2768834642,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"","submitted":976,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7947385170255649,"acs":7492,"articleLive":2,"columnArticles":174,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":9427,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5229599594526102,"acs":5159,"articleLive":2,"columnArticles":68,"formTitle":"[1813]句子相似性 III","frequency":1.229022426,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":9865,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.3411019114790964,"acs":3337,"articleLive":2,"columnArticles":76,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.3327171103,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":9783,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.3006384213580963,"acs":1554,"articleLive":2,"columnArticles":36,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5169,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7540297582145071,"acs":9730,"articleLive":2,"columnArticles":141,"formTitle":"[1816]截断句子","frequency":0.2768834642,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":12904,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6951234342697312,"acs":5716,"articleLive":2,"columnArticles":93,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.3327171103,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":8223,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.37413981511562655,"acs":25336,"articleLive":2,"columnArticles":337,"formTitle":"[1818]绝对差值和","frequency":2.2690405504,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":67718,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.36443719412724307,"acs":2234,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6130,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.46496815286624205,"acs":73,"articleLive":2,"columnArticles":7,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"","submitted":157,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9008226691042047,"acs":1971,"articleLive":2,"columnArticles":18,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":1.2623366327,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"","submitted":2188,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8132287470850117,"acs":19180,"articleLive":2,"columnArticles":186,"formTitle":"[1822]数组元素积的符号","frequency":0.8058212079,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":23585,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7054392486793191,"acs":7211,"articleLive":2,"columnArticles":89,"formTitle":"[1823]找出游戏的获胜者","frequency":0.8058212079,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":10222,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6621514645087518,"acs":7528,"articleLive":2,"columnArticles":151,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":11369,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.2869226488592098,"acs":2578,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.6036237946,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":8985,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.43953488372093025,"acs":189,"articleLive":2,"columnArticles":15,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"","submitted":430,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7959521619135235,"acs":8652,"articleLive":2,"columnArticles":132,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":10870,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.870800395256917,"acs":7050,"articleLive":2,"columnArticles":91,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.7773697867,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":8096,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.676355206847361,"acs":3793,"articleLive":2,"columnArticles":80,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":5608,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.48148148148148145,"acs":819,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1701,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7392218717139852,"acs":703,"articleLive":2,"columnArticles":20,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"","submitted":951,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8215139442231075,"acs":12372,"articleLive":2,"columnArticles":202,"formTitle":"[1832]判断句子是否为全字母句","frequency":1.1969752486,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":15060,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6852281761806328,"acs":43094,"articleLive":2,"columnArticles":385,"formTitle":"[1833]雪糕的最大数量","frequency":1.4623744168,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":62890,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3504684572142411,"acs":5611,"articleLive":2,"columnArticles":122,"formTitle":"[1834]单线程 CPU","frequency":1.5291604751,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":16010,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5072903132669265,"acs":3514,"articleLive":2,"columnArticles":59,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.6492521472,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":6927,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7105263157894737,"acs":297,"articleLive":2,"columnArticles":21,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.4966987206,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"","submitted":418,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7938144329896907,"acs":7161,"articleLive":2,"columnArticles":82,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":9021,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.4309235600817148,"acs":28266,"articleLive":2,"columnArticles":299,"formTitle":"[1838]最高频元素的频数","frequency":2.8311163642,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":65594,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5805375347544022,"acs":6264,"articleLive":2,"columnArticles":123,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":10790,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.390294917381301,"acs":1866,"articleLive":2,"columnArticles":44,"formTitle":"[1840]最高建筑高度","frequency":0.4610570293,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":4781,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5143299767621998,"acs":664,"articleLive":2,"columnArticles":25,"formTitle":"[1841]联赛信息统计","frequency":1.229022426,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"","submitted":1291,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.7086614173228346,"acs":90,"articleLive":2,"columnArticles":9,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"","submitted":127,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.524416135881104,"acs":494,"articleLive":2,"columnArticles":20,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.3327171103,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"","submitted":942,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.802680280791321,"acs":6289,"articleLive":2,"columnArticles":105,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":7835,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5819574835437574,"acs":5393,"articleLive":2,"columnArticles":53,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":9267,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6335155250610536,"acs":27238,"articleLive":2,"columnArticles":374,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":1.9925912299,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":42995,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.3592295345104334,"acs":2238,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":0.4966987206,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6230,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6854256854256854,"acs":7125,"articleLive":2,"columnArticles":92,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":10395,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.3292156027505629,"acs":5410,"articleLive":2,"columnArticles":106,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.3938048023,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":16433,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6061175207942044,"acs":2259,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":0.4610570293,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":3727,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.39696905914544306,"acs":1886,"articleLive":2,"columnArticles":45,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":4751,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.7009803921568627,"acs":143,"articleLive":2,"columnArticles":10,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"","submitted":204,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6487845766974015,"acs":774,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":0.3327171103,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"","submitted":1193,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7946383771772633,"acs":11086,"articleLive":2,"columnArticles":111,"formTitle":"[1854]人口最多的年份","frequency":1.1969752486,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":13951,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6919260568166372,"acs":10181,"articleLive":2,"columnArticles":97,"formTitle":"[1855]下标对中的最大距离","frequency":1.229022426,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":14714,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.356262222600119,"acs":4190,"articleLive":2,"columnArticles":80,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.9313777419,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":11761,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4476550344521005,"acs":2014,"articleLive":2,"columnArticles":30,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":4499,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.7084548104956269,"acs":243,"articleLive":2,"columnArticles":14,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.6492521472,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"","submitted":343,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7732305013061326,"acs":6216,"articleLive":2,"columnArticles":130,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":8039,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7717346518335394,"acs":3746,"articleLive":2,"columnArticles":60,"formTitle":"[1860]增长的内存泄露","frequency":0.2768834642,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":4854,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6184366363995263,"acs":3133,"articleLive":2,"columnArticles":66,"formTitle":"[1861]旋转盒子","frequency":0.3041926436,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5066,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.3099620216184633,"acs":2122,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":6846,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9234152855235253,"acs":11756,"articleLive":2,"columnArticles":133,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":1.9286395831,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":12731,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.3862561439302606,"acs":4165,"articleLive":2,"columnArticles":102,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.3938048023,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":10783,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5171747967479675,"acs":5089,"articleLive":2,"columnArticles":60,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":9840,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5945113413609633,"acs":2123,"articleLive":2,"columnArticles":48,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":1.0398908834,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3571,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7777777777777778,"acs":371,"articleLive":2,"columnArticles":13,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"","submitted":477,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5561797752808989,"acs":99,"articleLive":2,"columnArticles":9,"formTitle":"[1868]两个行程编码数组的积","frequency":0.8660803995,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"","submitted":178,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.8024031161286064,"acs":12154,"articleLive":2,"columnArticles":131,"formTitle":"[1869]哪种连续子字符串更长","frequency":1.1363444987,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":15147,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.461113580090153,"acs":7263,"articleLive":2,"columnArticles":70,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.3327171103,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":15751,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.27557177615571776,"acs":5663,"articleLive":2,"columnArticles":123,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":20550,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6240053050397878,"acs":1882,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3016,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.7983104540654699,"acs":1512,"articleLive":2,"columnArticles":27,"formTitle":"[1873]计算特殊奖金","frequency":1.7395770104,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"","submitted":1894,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.868421052631579,"acs":198,"articleLive":2,"columnArticles":13,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"","submitted":228,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7422434367541766,"acs":311,"articleLive":2,"columnArticles":17,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"","submitted":419,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7319816692126093,"acs":5271,"articleLive":2,"columnArticles":84,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":7201,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8195480473892058,"acs":29884,"articleLive":2,"columnArticles":394,"formTitle":"[1877]数组中最大数对和的最小值","frequency":2.6274381477,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":36464,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.42723102585487904,"acs":2049,"articleLive":2,"columnArticles":54,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":4796,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.4047893161409164,"acs":1758,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.4265946251,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4343,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7724631202503353,"acs":6912,"articleLive":2,"columnArticles":88,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.2768834642,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":8948,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.35139613378336915,"acs":5726,"articleLive":2,"columnArticles":62,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":16295,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.2766109785202864,"acs":3477,"articleLive":2,"columnArticles":109,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":12570,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.37023914968999116,"acs":1672,"articleLive":2,"columnArticles":25,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4516,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.7011972930765227,"acs":1347,"articleLive":2,"columnArticles":31,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":1.7051051014,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":1921,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5365853658536586,"acs":176,"articleLive":2,"columnArticles":8,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"","submitted":328,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5717349587989615,"acs":5065,"articleLive":2,"columnArticles":75,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.3041926436,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":8859,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6406312160190956,"acs":4831,"articleLive":2,"columnArticles":59,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.0,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":7541,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3138617359557178,"acs":2665,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.4265946251,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8491,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2744084851781344,"acs":2018,"articleLive":2,"columnArticles":40,"formTitle":"[1889]装包裹的最小浪费空间","frequency":1.0018055493,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":7354,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.696875,"acs":669,"articleLive":2,"columnArticles":16,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"","submitted":960,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.5035211267605634,"acs":143,"articleLive":2,"columnArticles":8,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"","submitted":284,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.35181236673773986,"acs":330,"articleLive":2,"columnArticles":11,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.3625522588,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"","submitted":938,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5915569326103796,"acs":30548,"articleLive":2,"columnArticles":402,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":2.0813292414,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":51640,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.4295988934993084,"acs":3106,"articleLive":2,"columnArticles":46,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":7230,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5313028764805414,"acs":1884,"articleLive":2,"columnArticles":38,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":3546,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5009299442033478,"acs":808,"articleLive":2,"columnArticles":30,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1613,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5275419902474264,"acs":5842,"articleLive":2,"columnArticles":72,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.2507039587,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":11074,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.3068430942687128,"acs":3919,"articleLive":2,"columnArticles":61,"formTitle":"[1898]可移除字符的最大数目","frequency":0.3938048023,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":12772,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6268019220501868,"acs":3522,"articleLive":2,"columnArticles":41,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":5619,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.4239457831325301,"acs":1126,"articleLive":2,"columnArticles":33,"formTitle":"[1900]最佳运动员的比拼回合","frequency":1.2128460785,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2656,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6582597730138714,"acs":522,"articleLive":2,"columnArticles":22,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":793,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.4296875,"acs":55,"articleLive":2,"columnArticles":3,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"","submitted":128,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6446064139941691,"acs":6633,"articleLive":2,"columnArticles":94,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":10290,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.27485430236544395,"acs":3207,"articleLive":2,"columnArticles":67,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":11668,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5736040609137056,"acs":4181,"articleLive":2,"columnArticles":85,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":7289,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.4216910453085979,"acs":2364,"articleLive":2,"columnArticles":53,"formTitle":"[1906]查询差绝对值的最小值","frequency":1.0798482563,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":5606,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.6317829457364341,"acs":326,"articleLive":2,"columnArticles":14,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"","submitted":516,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6507936507936508,"acs":82,"articleLive":2,"columnArticles":6,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"","submitted":126,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.32925553319919515,"acs":4091,"articleLive":2,"columnArticles":65,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.2507039587,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":12425,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6780179445350734,"acs":3325,"articleLive":2,"columnArticles":54,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":4904,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5636470128855916,"acs":2887,"articleLive":2,"columnArticles":63,"formTitle":"[1911]最大子序列交替和","frequency":0.2507039587,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":5122,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.3040796963946869,"acs":1282,"articleLive":2,"columnArticles":36,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":4216,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8468172983479106,"acs":6971,"articleLive":2,"columnArticles":72,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.2507039587,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":8232,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.43911752227407724,"acs":3105,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":0.8660803995,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7071,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3887695172611374,"acs":2714,"articleLive":2,"columnArticles":55,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":6981,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5548189699133096,"acs":1088,"articleLive":2,"columnArticles":17,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":0.966163858,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":1961,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.2829581993569132,"acs":176,"articleLive":2,"columnArticles":8,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"","submitted":622,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.4642857142857143,"acs":78,"articleLive":2,"columnArticles":2,"formTitle":"[1918]第 K 小的子序列和","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"","submitted":168,"title":"第 K 小的子序列和","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.41721854304635764,"acs":252,"articleLive":2,"columnArticles":9,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"","submitted":604,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9405309734513274,"acs":7971,"articleLive":2,"columnArticles":68,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":8475,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.3421173085725495,"acs":5232,"articleLive":2,"columnArticles":86,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.8980524322,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":15293,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3624353819643883,"acs":4417,"articleLive":2,"columnArticles":78,"formTitle":"[1922]统计好数字的数目","frequency":0.3041926436,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":12187,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.23557046979865773,"acs":1404,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":1.2623366327,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":5960,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.5223880597014925,"acs":35,"articleLive":2,"columnArticles":2,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"","submitted":67,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6987104337631888,"acs":4172,"articleLive":2,"columnArticles":53,"formTitle":"[1925]统计平方和三元组的数目","frequency":1.4623744168,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":5971,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.34578930166684824,"acs":3174,"articleLive":2,"columnArticles":57,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":9179,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.40973782771535583,"acs":1641,"articleLive":2,"columnArticles":36,"formTitle":"[1927]求和游戏","frequency":0.2768834642,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4005,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.34955520669806384,"acs":1336,"articleLive":2,"columnArticles":29,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":1.3331626853,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":3822,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9426826655238911,"acs":8799,"articleLive":2,"columnArticles":73,"formTitle":"[1929]数组串联","frequency":0.1782084566,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":9334,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.47506849315068495,"acs":5202,"articleLive":2,"columnArticles":98,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":0.8058212079,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":10950,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5513230590287874,"acs":1896,"articleLive":2,"columnArticles":61,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.2768834642,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3439,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.32407709898725906,"acs":992,"articleLive":2,"columnArticles":35,"formTitle":"[1932]合并多棵二叉搜索树","frequency":0.4610570293,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3061,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5732484076433121,"acs":360,"articleLive":2,"columnArticles":21,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"","submitted":628,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7292576419213974,"acs":167,"articleLive":2,"columnArticles":8,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"","submitted":229,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7431795634920635,"acs":5993,"articleLive":2,"columnArticles":85,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":8064,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.44894173201787674,"acs":5324,"articleLive":2,"columnArticles":59,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":11859,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.23835946924004825,"acs":2964,"articleLive":2,"columnArticles":62,"formTitle":"[1937]扣分后的最大得分","frequency":0.8660803995,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":12435,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.3331216259129883,"acs":1049,"articleLive":2,"columnArticles":39,"formTitle":"[1938]查询最大基因差","frequency":0.8660803995,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3149,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6613756613756614,"acs":250,"articleLive":2,"columnArticles":9,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"","submitted":378,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.8264984227129337,"acs":262,"articleLive":2,"columnArticles":21,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"","submitted":317,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7781318462457678,"acs":3907,"articleLive":2,"columnArticles":68,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":5021,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.387977304094464,"acs":2530,"articleLive":2,"columnArticles":62,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":6521,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.4008589835361489,"acs":1680,"articleLive":2,"columnArticles":47,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4191,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.576068376068376,"acs":1685,"articleLive":2,"columnArticles":47,"formTitle":"[1944]队列中可以看到的人数","frequency":0.3041926436,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":2925,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6617811590959947,"acs":5915,"articleLive":2,"columnArticles":65,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.0356416913,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":8938,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.3023422562141491,"acs":5060,"articleLive":2,"columnArticles":75,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":0.3327171103,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":16736,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5361922578788315,"acs":3726,"articleLive":2,"columnArticles":80,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":6949,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5184534270650264,"acs":885,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.2255770086,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1707,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5514018691588785,"acs":118,"articleLive":2,"columnArticles":9,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"","submitted":214,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5572916666666666,"acs":107,"articleLive":2,"columnArticles":5,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"","submitted":192,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.7228915662650602,"acs":120,"articleLive":2,"columnArticles":10,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"","submitted":166,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5413153456998314,"acs":6099,"articleLive":2,"columnArticles":67,"formTitle":"[1952]三除数","frequency":0.0712833827,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":11267,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3181376518218623,"acs":3929,"articleLive":2,"columnArticles":81,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":12350,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.48076682120035086,"acs":3837,"articleLive":2,"columnArticles":65,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.0,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":7981,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.49375383985254967,"acs":2411,"articleLive":2,"columnArticles":38,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":4883,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.43014705882352944,"acs":117,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":1.0798482563,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"","submitted":272,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6070341562394319,"acs":3590,"articleLive":2,"columnArticles":44,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":5914,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.4176917510853835,"acs":2309,"articleLive":2,"columnArticles":41,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":5528,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.40805152979066023,"acs":1267,"articleLive":2,"columnArticles":30,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3105,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.27707676130389064,"acs":527,"articleLive":2,"columnArticles":16,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":1902,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5339500785477396,"acs":6118,"articleLive":2,"columnArticles":52,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.106925074,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":11458,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.42352841820792164,"acs":5015,"articleLive":2,"columnArticles":68,"formTitle":"[1962]移除石子使总数最小","frequency":0.4966987206,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":11841,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6112997838839148,"acs":3960,"articleLive":2,"columnArticles":52,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.2014329097,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":6478,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.38119138819178444,"acs":2886,"articleLive":2,"columnArticles":43,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":7571,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7387387387387387,"acs":164,"articleLive":2,"columnArticles":6,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"","submitted":222,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.6785714285714286,"acs":19,"articleLive":2,"columnArticles":4,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"","submitted":28,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7699323330391291,"acs":5234,"articleLive":2,"columnArticles":46,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":6798,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.34648328117278865,"acs":4207,"articleLive":2,"columnArticles":64,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":12142,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.2705396697543294,"acs":2687,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":1.3709030133,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":9932,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.4745,"acs":1898,"articleLive":2,"columnArticles":45,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":1.4308011549,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4000,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5377777777777778,"acs":121,"articleLive":2,"columnArticles":10,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":225,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.42857142857142855,"acs":33,"articleLive":2,"columnArticles":5,"formTitle":"[1972]First and Last Call On the Same Day","frequency":1.6398929527,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"","submitted":77,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.4125,"acs":33,"articleLive":2,"columnArticles":7,"formTitle":"[1973]Count Nodes Equal to Sum of Descendants","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"","submitted":80,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7453729669097028,"acs":2658,"articleLive":2,"columnArticles":33,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.5679821033,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":3566,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.3634788634788635,"acs":2098,"articleLive":2,"columnArticles":34,"formTitle":"[1975]最大方阵和","frequency":0.8058212079,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":5772,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.24267100977198697,"acs":1192,"articleLive":2,"columnArticles":18,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":4912,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.1880625296068214,"acs":397,"articleLive":2,"columnArticles":10,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":2111,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.8536538088776895,"acs":4404,"articleLive":2,"columnArticles":34,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":5159,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5305885389778007,"acs":4111,"articleLive":2,"columnArticles":70,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.0,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":7748,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.2538655160014383,"acs":2824,"articleLive":2,"columnArticles":57,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":1.5645561361,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":11124,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.39070567986230637,"acs":454,"articleLive":2,"columnArticles":12,"formTitle":"[1982]从子集的和还原数组","frequency":0.0,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1162,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.844298315278969,"acs":79733,"articleLive":2,"columnArticles":614,"formTitle":"[LCP 01]猜数字","frequency":2.121137653,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":94437,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6878597454718276,"acs":13026,"articleLive":2,"columnArticles":226,"formTitle":"[LCP 02]分式化简","frequency":1.4623744168,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":18937,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.21743550125033037,"acs":10695,"articleLive":2,"columnArticles":178,"formTitle":"[LCP 03]机器人大冒险","frequency":1.4951320132,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":49187,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.3731089842543995,"acs":2417,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 04]覆盖","frequency":1.9870891527,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":6478,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.19517388218594747,"acs":1925,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":9863,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8389324523345142,"acs":42153,"articleLive":2,"columnArticles":639,"formTitle":"[LCP 06]拿硬币","frequency":1.6719059297,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":50246,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7712628070608567,"acs":37488,"articleLive":2,"columnArticles":453,"formTitle":"[LCP 07]传递信息","frequency":3.3099871973,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":48606,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.28097669777542994,"acs":4787,"articleLive":2,"columnArticles":98,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17037,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.264430368453921,"acs":5928,"articleLive":2,"columnArticles":103,"formTitle":"[LCP 09]最小跳跃次数","frequency":2.9469865697,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":22418,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.579302987197724,"acs":1629,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 10]二叉树任务调度","frequency":1.2623366327,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":2812,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6829013377926422,"acs":6534,"articleLive":2,"columnArticles":64,"formTitle":"[LCP 11]期望个数统计","frequency":0.3625522588,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":9568,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4053419835737456,"acs":5873,"articleLive":2,"columnArticles":96,"formTitle":"[LCP 12]小张刷题计划","frequency":1.8450487545,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":14489,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6158536585365854,"acs":9292,"articleLive":2,"columnArticles":83,"formTitle":"[LCP 13]寻宝","frequency":0.6036237946,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15088,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.1991419088480531,"acs":2460,"articleLive":2,"columnArticles":40,"formTitle":"[LCP 14]切分数组","frequency":1.9870891527,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":12353,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5711191335740072,"acs":791,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":0.8058212079,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1385,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.29201101928374656,"acs":530,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":1815,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7973954859770438,"acs":22717,"articleLive":2,"columnArticles":238,"formTitle":"[LCP 17]速算机器人","frequency":1.6398929527,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":28489,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2827682987353037,"acs":16523,"articleLive":2,"columnArticles":206,"formTitle":"[LCP 18]早餐组合","frequency":1.6719059297,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":58433,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5158026466437682,"acs":19372,"articleLive":2,"columnArticles":201,"formTitle":"[LCP 19]秋叶收藏集","frequency":1.6089881446,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":37557,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.29560460290511226,"acs":1567,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 20]快速公交","frequency":1.1661086006,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5301,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.315742397137746,"acs":706,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 21]追逐游戏","frequency":1.2623366327,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2236,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3315634669009511,"acs":8680,"articleLive":2,"columnArticles":182,"formTitle":"[LCP 22]黑白方格画","frequency":2.5148736074,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":26179,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.33174126637554585,"acs":2431,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":1.0398908834,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7328,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.2662760416666667,"acs":818,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3072,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.3187385180649112,"acs":1041,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3266,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3265720081135903,"acs":483,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1479,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.3252387448840382,"acs":1192,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 27]黑盒光线反射","frequency":1.6398929527,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3665,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.2640874684608915,"acs":8164,"articleLive":2,"columnArticles":143,"formTitle":"[LCP 28]采购方案","frequency":1.4951320132,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":30914,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.16732408703397378,"acs":3945,"articleLive":2,"columnArticles":105,"formTitle":"[LCP 29]乐团站位","frequency":2.3713792637,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":23577,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3292138939670932,"acs":4502,"articleLive":2,"columnArticles":77,"formTitle":"[LCP 30]魔塔游戏","frequency":0.3327171103,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"notac","submitted":13675,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.21644017235664567,"acs":1306,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 31]变换的迷宫","frequency":0.0,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":6034,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.349437148217636,"acs":745,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 32]批量处理任务","frequency":1.1218535916,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2132,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.1953815047355539,"acs":3672,"articleLive":2,"columnArticles":73,"formTitle":"[LCP 33]蓄水","frequency":1.1969752486,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":18794,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.45456674473067915,"acs":1941,"articleLive":2,"columnArticles":56,"formTitle":"[LCP 34]二叉树染色","frequency":1.4623744168,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":4270,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.35876042908224076,"acs":903,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 35]电动车游城市","frequency":1.1218535916,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":2517,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.224,"acs":588,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 36]最多牌组数","frequency":1.9348384624,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":2625,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.1730180806675939,"acs":622,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 37]最小矩形面积","frequency":1.7663237238,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":3595,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5156017830609212,"acs":347,"articleLive":2,"columnArticles":13,"formTitle":"[LCP 38]守卫城堡","frequency":1.4308011549,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":673,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5363428943937418,"acs":3291,"articleLive":2,"columnArticles":81,"formTitle":"[LCS 01]下载插件","frequency":1.229022426,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":6136,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.7053227050655696,"acs":2743,"articleLive":2,"columnArticles":51,"formTitle":"[LCS 02]完成一半题目","frequency":0.8353654542,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":3889,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4165984165984166,"acs":1526,"articleLive":2,"columnArticles":50,"formTitle":"[LCS 03]主题空间","frequency":0.2768834642,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":3663,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6786017458009654,"acs":370125,"articleLive":2,"columnArticles":2653,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":4.6523769809,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":545423,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.4031028613333154,"acs":239664,"articleLive":2,"columnArticles":1962,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":3.8073280932,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":594548,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7619231722721317,"acs":258167,"articleLive":2,"columnArticles":1826,"formTitle":"[剑指 Offer 05]替换空格","frequency":3.2459709292,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":338836,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7523858199993955,"acs":273809,"articleLive":2,"columnArticles":1954,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":3.7005621126,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":363921,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6953581394613482,"acs":175927,"articleLive":2,"columnArticles":1376,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":4.112736251,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":253002,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7178138584660758,"acs":233652,"articleLive":2,"columnArticles":1525,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":4.3098652761,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":325505,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3478543217316899,"acs":215869,"articleLive":2,"columnArticles":1590,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":3.8901912093,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"","submitted":620573,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.4407219186188172,"acs":177261,"articleLive":2,"columnArticles":1239,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":3.6189088599,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":402206,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.4936705737706603,"acs":240111,"articleLive":2,"columnArticles":1538,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":4.0353348386,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":486379,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.453005374991958,"acs":154907,"articleLive":2,"columnArticles":1049,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":3.1062300215,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":341954,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5245353461569677,"acs":161570,"articleLive":2,"columnArticles":1625,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":3.5757410974,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":308025,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5680686263119167,"acs":146681,"articleLive":2,"columnArticles":1239,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":3.2890132741,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":258210,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.31089926407530766,"acs":77944,"articleLive":2,"columnArticles":467,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":1.8785489841,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":250705,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7457693774430355,"acs":187737,"articleLive":2,"columnArticles":1207,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":2.5579159926,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":251736,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.3378263710466639,"acs":114262,"articleLive":2,"columnArticles":716,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":1.6664902652,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":338227,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7774180982217809,"acs":141693,"articleLive":2,"columnArticles":1081,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":3.1239354746,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":182261,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5946763128181016,"acs":173275,"articleLive":2,"columnArticles":1388,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":2.8548043315,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":291377,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.3740326326265947,"acs":62009,"articleLive":2,"columnArticles":420,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":2.7595095142,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":165785,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.2386864918614817,"acs":71531,"articleLive":2,"columnArticles":795,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":3.5793809063,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":299686,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6423325002455608,"acs":176565,"articleLive":2,"columnArticles":1511,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":2.6564780666,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":274881,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7894983382034753,"acs":212364,"articleLive":2,"columnArticles":2064,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":4.1658343234,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":268986,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7425524759689488,"acs":264965,"articleLive":2,"columnArticles":1730,"formTitle":"[剑指 Offer 24]反转链表","frequency":4.6539220747,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":356830,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7288351781390522,"acs":168565,"articleLive":2,"columnArticles":1108,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":3.7349189667,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":231280,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.4653245437907568,"acs":130940,"articleLive":2,"columnArticles":1101,"formTitle":"[剑指 Offer 26]树的子结构","frequency":3.2594899631,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":281395,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7905640534941347,"acs":175155,"articleLive":2,"columnArticles":1314,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":3.0919231809,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":221557,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5799139939079018,"acs":135933,"articleLive":2,"columnArticles":1020,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":2.3043300274,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":234402,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.4396216438898278,"acs":135527,"articleLive":2,"columnArticles":1406,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":3.856495299,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":308281,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5741530561300906,"acs":120753,"articleLive":2,"columnArticles":821,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":2.6798280867,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":210315,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6134379214878967,"acs":103698,"articleLive":2,"columnArticles":864,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":1.9133230025,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":169044,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6463992941954931,"acs":123088,"articleLive":2,"columnArticles":878,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":3.0831585284,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":190421,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.68619686528698,"acs":124074,"articleLive":2,"columnArticles":1008,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":2.7225827467,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":180814,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5887463479999121,"acs":107206,"articleLive":2,"columnArticles":1050,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":2.7935650186,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":182092,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.548557030390338,"acs":103194,"articleLive":2,"columnArticles":884,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":2.9960329748,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":188119,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5774931294061417,"acs":120826,"articleLive":2,"columnArticles":801,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":3.179742317,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":209225,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7218639036839769,"acs":104087,"articleLive":2,"columnArticles":752,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":2.8156409703,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":144192,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6536336206596194,"acs":93801,"articleLive":2,"columnArticles":836,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":3.3833338447,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":143507,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5583990409000784,"acs":72660,"articleLive":2,"columnArticles":537,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":3.3833338447,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":130122,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.579592029576084,"acs":147210,"articleLive":2,"columnArticles":1061,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":4.538038603,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":253989,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6888773669773152,"acs":155450,"articleLive":2,"columnArticles":969,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":3.006552643,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":225657,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5690702588483888,"acs":228377,"articleLive":2,"columnArticles":1722,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":3.7421137055,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":401316,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5789489883859318,"acs":56429,"articleLive":2,"columnArticles":421,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":2.2472531963,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":97468,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6053073624017156,"acs":203238,"articleLive":2,"columnArticles":1454,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":4.4488938243,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":335760,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.48154446963970776,"acs":45870,"articleLive":2,"columnArticles":479,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":2.5693047726,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":95256,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.4124985950320333,"acs":51380,"articleLive":2,"columnArticles":431,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":2.3650835995,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":124558,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5616814313010249,"acs":97008,"articleLive":2,"columnArticles":734,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":3.3576188767,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":172710,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5394353268708958,"acs":106956,"articleLive":2,"columnArticles":1348,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":3.4452539615,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":198274,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6888838342810722,"acs":106002,"articleLive":2,"columnArticles":906,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":2.7478949817,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":153875,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.46452641321860755,"acs":135507,"articleLive":2,"columnArticles":938,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":3.5285862716,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":291710,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6513992041371978,"acs":80866,"articleLive":2,"columnArticles":486,"formTitle":"[剑指 Offer 49]丑数","frequency":3.1267519812,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":124142,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6140040831377205,"acs":136541,"articleLive":2,"columnArticles":970,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":3.2029905279,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":222378,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.4807458576285789,"acs":93744,"articleLive":2,"columnArticles":798,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":4.3345114086,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":194997,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.64678980124473,"acs":161083,"articleLive":2,"columnArticles":1000,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":3.3081292895,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":249050,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5405069950447172,"acs":171578,"articleLive":2,"columnArticles":1484,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":2.8852543408,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":317439,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.44750904198030494,"acs":150828,"articleLive":2,"columnArticles":1370,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":2.8858945702,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":337039,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7542515104050123,"acs":148313,"articleLive":2,"columnArticles":1071,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":2.2797587667,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":196636,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7888442578053679,"acs":164179,"articleLive":2,"columnArticles":1203,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":3.1069377607,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":208126,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.586229474462045,"acs":125347,"articleLive":2,"columnArticles":874,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":2.5168562009,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":213819,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.7000295673313841,"acs":106541,"articleLive":2,"columnArticles":971,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":3.0719131242,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":152195,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.7993079249379652,"acs":82463,"articleLive":2,"columnArticles":655,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":2.4498082495,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":103168,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6622424354928531,"acs":121295,"articleLive":2,"columnArticles":770,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":3.1144894118,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":183158,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7059458045958226,"acs":129582,"articleLive":2,"columnArticles":1792,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":3.1181116855,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":183558,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.44083642322592337,"acs":116752,"articleLive":2,"columnArticles":885,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":2.8079952834,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":264842,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8561631457737701,"acs":184766,"articleLive":2,"columnArticles":1678,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":2.7953855179,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":215807,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.4441306157464458,"acs":122179,"articleLive":2,"columnArticles":1128,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":3.675602272,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":275097,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.47413226789579677,"acs":88053,"articleLive":2,"columnArticles":1029,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":2.4688653182,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":185714,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5586508490346592,"acs":60041,"articleLive":2,"columnArticles":542,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":2.9192532337,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":107475,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.4601570088217329,"acs":91909,"articleLive":2,"columnArticles":888,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":3.2554868353,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":199734,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.654713565239881,"acs":101258,"articleLive":2,"columnArticles":717,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":3.5640038734,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":154660,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6338633879781421,"acs":115997,"articleLive":2,"columnArticles":886,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":3.1144894118,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":183000,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8565465479527196,"acs":128046,"articleLive":2,"columnArticles":1236,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":2.756107456,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":149491,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.58118318788894,"acs":64534,"articleLive":2,"columnArticles":456,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":2.155021972,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":111039,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5973226455800182,"acs":66172,"articleLive":2,"columnArticles":470,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":2.7248664523,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":110781,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.28454124180584717,"acs":62201,"articleLive":2,"columnArticles":520,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":2.6324456694,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":218601,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6930162106416579,"acs":107518,"articleLive":2,"columnArticles":633,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":2.3043300274,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":155145,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.6988900496213111,"acs":107042,"articleLive":2,"columnArticles":636,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":2.9960329748,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":153160,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.2150702818956909,"acs":2800,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 001]整数除法","frequency":0.4610570293,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":13019,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5970777064423289,"acs":2697,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":4517,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7927927927927928,"acs":3344,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.4265946251,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":4218,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6985645933014354,"acs":2482,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.532340412,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":3553,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7217858619264159,"acs":1746,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":2419,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6758742286218042,"acs":2300,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.4966987206,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":3403,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.48511071519470605,"acs":1906,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":3929,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5284409077512526,"acs":1793,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":3393,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5634136704859739,"acs":1426,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":2531,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.440668202764977,"acs":1530,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":3472,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5834191555097837,"acs":1133,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":1942,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6739030023094689,"acs":1459,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.4610570293,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":2165,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6700468018720749,"acs":859,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":1282,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5280161534578496,"acs":1046,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":1981,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6505162827640985,"acs":819,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":1259,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.505,"acs":1313,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":2600,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5409197194076384,"acs":694,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":1283,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5509594882729211,"acs":1292,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":2345,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.49335863377609107,"acs":1040,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":1.1218535916,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":2108,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.6937191249117854,"acs":983,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.532340412,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":1417,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5307108350586611,"acs":1538,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":2898,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5260758050726703,"acs":1846,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":3509,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7079599367422246,"acs":1343,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.4265946251,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":1897,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7771254620569689,"acs":3574,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 024]反转链表","frequency":1.0018055493,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":4599,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6091245376078915,"acs":988,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":1.1218535916,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":1622,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6784643071385723,"acs":1131,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 026]重排链表","frequency":0.532340412,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":1667,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6441426146010186,"acs":1897,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":2945,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.5877862595419847,"acs":462,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":786,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.3071467539552646,"acs":563,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":1833,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.556687898089172,"acs":437,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":785,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.6044843049327354,"acs":674,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":1115,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.5981240981240982,"acs":829,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":1386,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7902374670184696,"acs":599,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":758,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5636182902584493,"acs":567,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":1006,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.7279102384291725,"acs":519,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":713,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5742471443406023,"acs":553,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":963,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.4824380165289256,"acs":467,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":968,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7852882703777336,"acs":790,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":1006,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.536046511627907,"acs":461,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":860,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5656192236598891,"acs":306,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":0.532340412,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":541,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7986829727187206,"acs":849,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":1063,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8640406607369758,"acs":680,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":787,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6492890995260664,"acs":274,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":422,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6631878557874763,"acs":699,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":1054,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.7773851590106007,"acs":660,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":849,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7141350210970464,"acs":677,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":948,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.713907284768212,"acs":539,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.0,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":755,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6929824561403509,"acs":395,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":570,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7490729295426453,"acs":606,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":809,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6190476190476191,"acs":364,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":588,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.425614489003881,"acs":329,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":0.532340412,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":773,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7602094240837697,"acs":726,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.4610570293,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":955,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6450261780104712,"acs":616,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.4966987206,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":955,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8853503184713376,"acs":556,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":628,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8925,"acs":357,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":400,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7354838709677419,"acs":684,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.4966987206,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":930,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.3503787878787879,"acs":185,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":528,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.5759312320916905,"acs":201,"articleLive":2,"columnArticles":4,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":349,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6166902404526167,"acs":436,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":707,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6306990881458967,"acs":415,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":658,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5168269230769231,"acs":215,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.0,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":416,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7125,"acs":285,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":400,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7581967213114754,"acs":185,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":244,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6635071090047393,"acs":140,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":211,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.5664335664335665,"acs":162,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":286,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6446886446886447,"acs":176,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":273,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6830357142857143,"acs":153,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":224,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.539360872954014,"acs":692,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":1283,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7271689497716894,"acs":637,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"","submitted":876,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6986128625472888,"acs":554,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":793,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5,"acs":124,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":248,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.441747572815534,"acs":819,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":1854,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5608856088560885,"acs":304,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":542,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.534102833158447,"acs":509,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 074]合并区间","frequency":0.532340412,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":953,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.730379746835443,"acs":577,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":790,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6576802507836991,"acs":1049,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":0.4966987206,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":1595,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5231990231990232,"acs":857,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":1638,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6269230769230769,"acs":652,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":1040,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8779620853080569,"acs":741,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":844,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.7446808510638298,"acs":455,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":611,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7945439045183291,"acs":932,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":1173,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6659979939819458,"acs":664,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.4610570293,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":997,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8766114180478821,"acs":952,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.5679821033,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":1086,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.7023305084745762,"acs":663,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":944,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8814432989690721,"acs":855,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":0.4610570293,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":970,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7382039573820396,"acs":485,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":657,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6086434573829532,"acs":507,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":833,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7411233053582956,"acs":1148,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":1549,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.609322974472808,"acs":549,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":901,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5223048327137546,"acs":281,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":538,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7596899224806202,"acs":392,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.532340412,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":516,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6313465783664459,"acs":286,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":453,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5172413793103449,"acs":225,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":435,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.6,"acs":195,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":325,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6964729259811226,"acs":1402,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":1.4951320132,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":2013,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.5202020202020202,"acs":206,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":396,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5105633802816901,"acs":145,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":284,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.733102253032929,"acs":423,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":577,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6606786427145709,"acs":662,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":1.0798482563,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":1002,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7663934426229508,"acs":374,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":488,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.4657534246575342,"acs":510,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 101]分割等和子串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":1095,"title":"分割等和子串","titleSlug":"NUPfPr"},{"acceptance":0.5626373626373626,"acs":256,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":455,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.5008103727714749,"acs":618,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":0.532340412,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":1234,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5382882882882883,"acs":239,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":444,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6887417218543046,"acs":832,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":0.4966987206,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":1208,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.6177474402730375,"acs":181,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 106]二分图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":293,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5311572700296736,"acs":179,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":337,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5193370165745856,"acs":94,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":181,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.5189873417721519,"acs":164,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":316,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8388520971302428,"acs":380,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":453,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.7013888888888888,"acs":101,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":144,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5799180327868853,"acs":283,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":488,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.6539325842696629,"acs":291,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":0.532340412,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":445,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.38961038961038963,"acs":90,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":231,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.2524752475247525,"acs":153,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.532340412,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":606,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.63202416918429,"acs":1046,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 116]朋友圈","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":1655,"title":"朋友圈","titleSlug":"bLyHh0"},{"acceptance":0.5769230769230769,"acs":135,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":234,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6556776556776557,"acs":179,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":273,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.46329426280074026,"acs":751,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":0.532340412,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":1621,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7214587231820357,"acs":82892,"articleLive":2,"columnArticles":1463,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":3.6908450173,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":114895,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6510102496199304,"acs":53099,"articleLive":2,"columnArticles":1037,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":2.3342186838,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":81564,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5801625784369652,"acs":40681,"articleLive":2,"columnArticles":444,"formTitle":"[面试题 01.03]URL化","frequency":1.898257939,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":70120,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5513877700476016,"acs":37646,"articleLive":2,"columnArticles":734,"formTitle":"[面试题 01.04]回文排列","frequency":2.2022005323,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":68275,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.33374866500534,"acs":30000,"articleLive":2,"columnArticles":523,"formTitle":"[面试题 01.05]一次编辑","frequency":2.1101109672,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":89888,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.4737656116338751,"acs":69229,"articleLive":2,"columnArticles":1125,"formTitle":"[面试题 01.06]字符串压缩","frequency":3.3508740004,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":146125,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7553911827482152,"acs":61581,"articleLive":2,"columnArticles":937,"formTitle":"[面试题 01.07]旋转矩阵","frequency":2.7595095142,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":81522,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6219815917704385,"acs":40208,"articleLive":2,"columnArticles":467,"formTitle":"[面试题 01.08]零矩阵","frequency":1.9286395831,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":64645,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5519078002581302,"acs":30361,"articleLive":2,"columnArticles":392,"formTitle":"[面试题 01.09]字符串轮转","frequency":1.4623744168,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":55011,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6846812971445501,"acs":60089,"articleLive":2,"columnArticles":661,"formTitle":"[面试题 02.01]移除重复节点","frequency":2.5279119417,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":87762,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7800042422049485,"acs":62515,"articleLive":2,"columnArticles":916,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":2.7966391064,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":80147,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8540191895025036,"acs":69249,"articleLive":2,"columnArticles":663,"formTitle":"[面试题 02.03]删除中间节点","frequency":2.9672932103,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":81086,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6582081246521981,"acs":23656,"articleLive":2,"columnArticles":341,"formTitle":"[面试题 02.04]分割链表","frequency":2.4188715691,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":35940,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.46691774141107617,"acs":34466,"articleLive":2,"columnArticles":501,"formTitle":"[面试题 02.05]链表求和","frequency":3.6930486321,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":73816,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.48231532408747596,"acs":36655,"articleLive":2,"columnArticles":485,"formTitle":"[面试题 02.06]回文链表","frequency":1.7815319859,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":75998,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6879126293315816,"acs":41887,"articleLive":2,"columnArticles":379,"formTitle":"[面试题 02.07]链表相交","frequency":1.1363444987,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":60890,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5302494066702752,"acs":25470,"articleLive":2,"columnArticles":273,"formTitle":"[面试题 02.08]环路检测","frequency":2.430005062,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":48034,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5428291727851199,"acs":9981,"articleLive":2,"columnArticles":160,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":18387,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6121713262913757,"acs":24283,"articleLive":2,"columnArticles":278,"formTitle":"[面试题 03.02]栈的最小值","frequency":2.121137653,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":39667,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3877509112377432,"acs":7553,"articleLive":2,"columnArticles":117,"formTitle":"[面试题 03.03]堆盘子","frequency":1.4623744168,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":19479,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7114218815152196,"acs":22180,"articleLive":2,"columnArticles":331,"formTitle":"[面试题 03.04]化栈为队","frequency":1.9600604803,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":31177,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5463844943261824,"acs":13193,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 03.05]栈排序","frequency":0.8058212079,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":24146,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5895817355908206,"acs":9994,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 03.06]动物收容所","frequency":1.4951320132,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":16951,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5346239517819706,"acs":16321,"articleLive":2,"columnArticles":228,"formTitle":"[面试题 04.01]节点间通路","frequency":1.7051051014,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":30528,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7894209911563491,"acs":33117,"articleLive":2,"columnArticles":404,"formTitle":"[面试题 04.02]最小高度树","frequency":2.5148736074,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":41951,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8058143213695644,"acs":22923,"articleLive":2,"columnArticles":502,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":1.9286395831,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":28447,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5832553702786492,"acs":31795,"articleLive":2,"columnArticles":373,"formTitle":"[面试题 04.04]检查平衡性","frequency":1.1363444987,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":54513,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.35100762487377246,"acs":23984,"articleLive":2,"columnArticles":300,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":1.9286395831,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":68329,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5912755905511811,"acs":18773,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 04.06]后继者","frequency":0.8058212079,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":31750,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7170158030135979,"acs":15608,"articleLive":2,"columnArticles":167,"formTitle":"[面试题 04.08]首个共同祖先","frequency":1.4308011549,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":21768,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47795401077635274,"acs":6298,"articleLive":2,"columnArticles":107,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":1.229022426,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":13177,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.718282704786984,"acs":15275,"articleLive":2,"columnArticles":239,"formTitle":"[面试题 04.10]检查子树","frequency":0.2507039587,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":21266,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.48835835007682304,"acs":16528,"articleLive":2,"columnArticles":246,"formTitle":"[面试题 04.12]求和路径","frequency":1.4308011549,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":33844,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5066265408877828,"acs":8754,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":17279,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6839140811455847,"acs":7164,"articleLive":2,"columnArticles":114,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.8353654542,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":10475,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.39160202627829666,"acs":9895,"articleLive":2,"columnArticles":216,"formTitle":"[面试题 05.03]翻转数位","frequency":1.8785489841,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":25268,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.3948269001193792,"acs":4961,"articleLive":2,"columnArticles":129,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":12565,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5274465311640033,"acs":10925,"articleLive":2,"columnArticles":213,"formTitle":"[面试题 05.06]整数转换","frequency":0.2768834642,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":20713,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7040423169855679,"acs":10781,"articleLive":2,"columnArticles":196,"formTitle":"[面试题 05.07]配对交换","frequency":0.8058212079,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":15313,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5538279533547406,"acs":3277,"articleLive":2,"columnArticles":68,"formTitle":"[面试题 05.08]绘制直线","frequency":1.1661086006,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":5917,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36381065003941804,"acs":40610,"articleLive":2,"columnArticles":448,"formTitle":"[面试题 08.01]三步问题","frequency":2.2417313711,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":111624,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.3605659222018112,"acs":11188,"articleLive":2,"columnArticles":184,"formTitle":"[面试题 08.02]迷路的机器人","frequency":1.7815319859,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":31029,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6769428985083746,"acs":50965,"articleLive":2,"columnArticles":425,"formTitle":"[面试题 08.03]魔术索引","frequency":0.2768834642,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":75287,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8227916441712696,"acs":19812,"articleLive":2,"columnArticles":312,"formTitle":"[面试题 08.04]幂集","frequency":2.088441647,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":24079,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.679021547635181,"acs":20042,"articleLive":2,"columnArticles":454,"formTitle":"[面试题 08.05]递归乘法","frequency":0.2255770086,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":29516,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6550593655856813,"acs":22179,"articleLive":2,"columnArticles":251,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":2.890728767,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":33858,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.813468818489739,"acs":20414,"articleLive":2,"columnArticles":302,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":2.088441647,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":25095,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7184931185119076,"acs":15296,"articleLive":2,"columnArticles":220,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":2.088441647,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":21289,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8112152476963063,"acs":20600,"articleLive":2,"columnArticles":332,"formTitle":"[面试题 08.09]括号","frequency":3.1206394927,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":25394,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5596741876470076,"acs":12849,"articleLive":2,"columnArticles":205,"formTitle":"[面试题 08.10]颜色填充","frequency":0.7773697867,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":22958,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.49481965842589276,"acs":33145,"articleLive":2,"columnArticles":320,"formTitle":"[面试题 08.11]硬币","frequency":2.4642102497,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":66984,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7582892373416186,"acs":15620,"articleLive":2,"columnArticles":282,"formTitle":"[面试题 08.12]八皇后","frequency":2.430005062,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":20599,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5015830299192655,"acs":6337,"articleLive":2,"columnArticles":86,"formTitle":"[面试题 08.13]堆箱子","frequency":0.8660803995,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":12634,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5326071580138634,"acs":3765,"articleLive":2,"columnArticles":71,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":7069,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5536635443374158,"acs":54202,"articleLive":2,"columnArticles":2358,"formTitle":"[面试题 10.01]合并排序的数组","frequency":3.5360690961,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":97897,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7393844616754631,"acs":34042,"articleLive":2,"columnArticles":425,"formTitle":"[面试题 10.02]变位词组","frequency":2.9322912281,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":46041,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.39691892425688796,"acs":12058,"articleLive":2,"columnArticles":199,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":2.8562159835,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":30379,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.552587091710439,"acs":18305,"articleLive":2,"columnArticles":245,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":1.1969752486,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":33126,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.45603075444497837,"acs":12337,"articleLive":2,"columnArticles":159,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":2.1704854006,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":27053,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6297613754261153,"acs":4249,"articleLive":2,"columnArticles":80,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.3327171103,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":6747,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6663868681216191,"acs":7145,"articleLive":2,"columnArticles":91,"formTitle":"[面试题 10.11]峰与谷","frequency":1.9600604803,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":10722,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8326862825228171,"acs":24451,"articleLive":2,"columnArticles":388,"formTitle":"[面试题 16.01]交换数字","frequency":1.4951320132,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":29364,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.765415697996236,"acs":13828,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 16.02]单词频率","frequency":0.2768834642,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":18066,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.44319618031175395,"acs":9468,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 16.03]交点","frequency":0.3625522588,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21363,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.4610057819013043,"acs":6857,"articleLive":2,"columnArticles":151,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":14874,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.46397172120003627,"acs":10238,"articleLive":2,"columnArticles":124,"formTitle":"[面试题 16.05]阶乘尾数","frequency":1.4623744168,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":22066,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4239230388342647,"acs":11986,"articleLive":2,"columnArticles":179,"formTitle":"[面试题 16.06]最小差","frequency":1.7051051014,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":28274,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7338056284003288,"acs":18748,"articleLive":2,"columnArticles":277,"formTitle":"[面试题 16.07]最大数值","frequency":1.8450487545,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":25549,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.37737150741635045,"acs":2188,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.3938048023,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":5798,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5468045611243701,"acs":2062,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":3771,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6849083215796897,"acs":9712,"articleLive":2,"columnArticles":181,"formTitle":"[面试题 16.10]生存人数","frequency":1.1969752486,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":14180,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.441086024476553,"acs":49485,"articleLive":2,"columnArticles":571,"formTitle":"[面试题 16.11]跳水板","frequency":1.1661086006,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":112189,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.4321631878557875,"acs":1822,"articleLive":2,"columnArticles":48,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4216,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5494791666666666,"acs":3376,"articleLive":2,"columnArticles":55,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6144,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5023435182438446,"acs":8467,"articleLive":2,"columnArticles":209,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.2768834642,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":16855,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4507205352547607,"acs":14012,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 16.16]部分排序","frequency":1.9600604803,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":31088,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6013174517235156,"acs":33319,"articleLive":2,"columnArticles":364,"formTitle":"[面试题 16.17]连续数列","frequency":2.121137653,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":55410,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3443440899956111,"acs":14907,"articleLive":2,"columnArticles":305,"formTitle":"[面试题 16.18]模式匹配","frequency":1.4951320132,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":43291,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.608823437451146,"acs":19472,"articleLive":2,"columnArticles":346,"formTitle":"[面试题 16.19]水域大小","frequency":2.4817853945,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":31983,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7200275410964799,"acs":8366,"articleLive":2,"columnArticles":161,"formTitle":"[面试题 16.20]T9键盘","frequency":1.4623744168,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":11619,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.46488851844134194,"acs":8924,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 16.21]交换和","frequency":0.2768834642,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":19196,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5815918185860383,"acs":2616,"articleLive":2,"columnArticles":54,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.3625522588,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4498,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47027225563564573,"acs":10243,"articleLive":2,"columnArticles":151,"formTitle":"[面试题 16.24]数对和","frequency":1.1661086006,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":21781,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5435797446521307,"acs":28994,"articleLive":2,"columnArticles":246,"formTitle":"[面试题 16.25]LRU 缓存","frequency":4.2805962087,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":53339,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.38640218484979155,"acs":13441,"articleLive":2,"columnArticles":190,"formTitle":"[面试题 16.26]计算器","frequency":2.9322912281,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":34785,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5991346005254211,"acs":11631,"articleLive":2,"columnArticles":164,"formTitle":"[面试题 17.01]不用加号的加法","frequency":1.1969752486,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":19413,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6457940492224807,"acs":26371,"articleLive":2,"columnArticles":430,"formTitle":"[面试题 17.04]消失的数字","frequency":2.0263098659,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":40835,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.3855766335441132,"acs":5122,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.8980524322,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":13284,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.4469013084491328,"acs":4406,"articleLive":2,"columnArticles":102,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.2768834642,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":9859,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.4115777976367789,"acs":8290,"articleLive":2,"columnArticles":210,"formTitle":"[面试题 17.07]婴儿名字","frequency":1.6719059297,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":20142,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.271703409557716,"acs":7937,"articleLive":2,"columnArticles":114,"formTitle":"[面试题 17.08]马戏团人塔","frequency":1.9133230025,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":29212,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5491840528816361,"acs":13293,"articleLive":2,"columnArticles":133,"formTitle":"[面试题 17.09]第 k 个数","frequency":2.5930995566,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":24205,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5713814819312643,"acs":65870,"articleLive":2,"columnArticles":911,"formTitle":"[面试题 17.10]主要元素","frequency":2.9505096849,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":115282,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6862696728995017,"acs":13910,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 17.11]单词距离","frequency":1.7051051014,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":20269,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6319285532672261,"acs":19883,"articleLive":2,"columnArticles":283,"formTitle":"[面试题 17.12]BiNode","frequency":0.8353654542,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":31464,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5531003846858399,"acs":24155,"articleLive":2,"columnArticles":261,"formTitle":"[面试题 17.13]恢复空格","frequency":1.4623744168,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":43672,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5473365796074959,"acs":37093,"articleLive":2,"columnArticles":416,"formTitle":"[面试题 17.14]最小K个数","frequency":3.5586576966,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"","submitted":67770,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.40260610573343264,"acs":5407,"articleLive":2,"columnArticles":111,"formTitle":"[面试题 17.15]最长单词","frequency":1.4951320132,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":13430,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5195315921313084,"acs":59317,"articleLive":2,"columnArticles":1119,"formTitle":"[面试题 17.16]按摩师","frequency":2.7000389606,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":114174,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4424451858913251,"acs":7426,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 17.17]多次搜索","frequency":0.8353654542,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":16784,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.4466688546110929,"acs":6805,"articleLive":2,"columnArticles":112,"formTitle":"[面试题 17.18]最短超串","frequency":0.8660803995,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":15235,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5816196284215005,"acs":8202,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 17.19]消失的两个数字","frequency":1.6089881446,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":14102,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5686910832946994,"acs":3680,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 17.20]连续中值","frequency":0.8353654542,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":6471,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6351236769779545,"acs":43445,"articleLive":2,"columnArticles":527,"formTitle":"[面试题 17.21]直方图的水量","frequency":4.201939328,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":68404,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.37083389404745887,"acs":8267,"articleLive":2,"columnArticles":148,"formTitle":"[面试题 17.22]单词转换","frequency":1.9600604803,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":22293,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.38026637673280783,"acs":4197,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.3327171103,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":11037,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5138572513287776,"acs":8121,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 17.24]最大子矩阵","frequency":3.0002472928,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":15804,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.4933431952662722,"acs":1334,"articleLive":2,"columnArticles":37,"formTitle":"[面试题 17.25]单词矩阵","frequency":1.3331626853,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":2704,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3404187817258883,"acs":3219,"articleLive":2,"columnArticles":48,"formTitle":"[面试题 17.26]稀疏相似度","frequency":0.8980524322,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":9456,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}]