[{"formTitle":"[1]两数之和","frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","title":"两数之和","titleSlug":"two-sum"},{"formTitle":"[2]两数相加","frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"","title":"两数相加","titleSlug":"add-two-numbers"},{"formTitle":"[3]无重复字符的最长子串","frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"formTitle":"[4]寻找两个有序数组的中位数","frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"","title":"寻找两个有序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"formTitle":"[5]最长回文子串","frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"","title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"formTitle":"[6]Z 字形变换","frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"","title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"formTitle":"[7]整数反转","frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"notac","title":"整数反转","titleSlug":"reverse-integer"},{"formTitle":"[8]字符串转换整数 (atoi)","frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"formTitle":"[9]回文数","frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","title":"回文数","titleSlug":"palindrome-number"},{"formTitle":"[10]正则表达式匹配","frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"","title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"formTitle":"[11]盛最多水的容器","frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"formTitle":"[12]整数转罗马数字","frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"","title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"formTitle":"[13]罗马数字转整数","frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"","title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"formTitle":"[14]最长公共前缀","frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"formTitle":"[15]三数之和","frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"","title":"三数之和","titleSlug":"3sum"},{"formTitle":"[16]最接近的三数之和","frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","title":"最接近的三数之和","titleSlug":"3sum-closest"},{"formTitle":"[17]电话号码的字母组合","frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"","title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"formTitle":"[18]四数之和","frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","title":"四数之和","titleSlug":"4sum"},{"formTitle":"[19]删除链表的倒数第N个节点","frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"","title":"删除链表的倒数第N个节点","titleSlug":"remove-nth-node-from-end-of-list"},{"formTitle":"[20]有效的括号","frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"","title":"有效的括号","titleSlug":"valid-parentheses"},{"formTitle":"[21]合并两个有序链表","frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"","title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"formTitle":"[22]括号生成","frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"","title":"括号生成","titleSlug":"generate-parentheses"},{"formTitle":"[23]合并K个排序链表","frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"","title":"合并K个排序链表","titleSlug":"merge-k-sorted-lists"},{"formTitle":"[24]两两交换链表中的节点","frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"","title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"formTitle":"[25]K 个一组翻转链表","frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"","title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"formTitle":"[26]删除排序数组中的重复项","frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","title":"删除排序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"formTitle":"[27]移除元素","frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","title":"移除元素","titleSlug":"remove-element"},{"formTitle":"[28]实现 strStr()","frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"","title":"实现 strStr()","titleSlug":"implement-strstr"},{"formTitle":"[29]两数相除","frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"","title":"两数相除","titleSlug":"divide-two-integers"},{"formTitle":"[30]串联所有单词的子串","frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"","title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"formTitle":"[31]下一个排列","frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"","title":"下一个排列","titleSlug":"next-permutation"},{"formTitle":"[32]最长有效括号","frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"formTitle":"[33]搜索旋转排序数组","frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"","title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"","title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"formTitle":"[35]搜索插入位置","frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"","title":"搜索插入位置","titleSlug":"search-insert-position"},{"formTitle":"[36]有效的数独","frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"","title":"有效的数独","titleSlug":"valid-sudoku"},{"formTitle":"[37]解数独","frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","title":"解数独","titleSlug":"sudoku-solver"},{"formTitle":"[38]报数","frontendQuestionId":"38","leaf":true,"level":1,"nodeType":"def","questionId":"38","status":"","title":"报数","titleSlug":"count-and-say"},{"formTitle":"[39]组合总和","frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"","title":"组合总和","titleSlug":"combination-sum"},{"formTitle":"[40]组合总和 II","frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"","title":"组合总和 II","titleSlug":"combination-sum-ii"},{"formTitle":"[41]缺失的第一个正数","frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"","title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"formTitle":"[42]接雨水","frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"","title":"接雨水","titleSlug":"trapping-rain-water"},{"formTitle":"[43]字符串相乘","frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"","title":"字符串相乘","titleSlug":"multiply-strings"},{"formTitle":"[44]通配符匹配","frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","title":"通配符匹配","titleSlug":"wildcard-matching"},{"formTitle":"[45]跳跃游戏 II","frontendQuestionId":"45","leaf":true,"level":3,"nodeType":"def","questionId":"45","status":"","title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"formTitle":"[46]全排列","frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"","title":"全排列","titleSlug":"permutations"},{"formTitle":"[47]全排列 II","frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"","title":"全排列 II","titleSlug":"permutations-ii"},{"formTitle":"[48]旋转图像","frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"","title":"旋转图像","titleSlug":"rotate-image"},{"formTitle":"[49]字母异位词分组","frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"","title":"字母异位词分组","titleSlug":"group-anagrams"},{"formTitle":"[50]Pow(x, n)","frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"","title":"Pow(x, n)","titleSlug":"powx-n"},{"formTitle":"[51]N皇后","frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"","title":"N皇后","titleSlug":"n-queens"},{"formTitle":"[52]N皇后 II","frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","title":"N皇后 II","titleSlug":"n-queens-ii"},{"formTitle":"[53]最大子序和","frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"","title":"最大子序和","titleSlug":"maximum-subarray"},{"formTitle":"[54]螺旋矩阵","frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"formTitle":"[55]跳跃游戏","frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"","title":"跳跃游戏","titleSlug":"jump-game"},{"formTitle":"[56]合并区间","frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"","title":"合并区间","titleSlug":"merge-intervals"},{"formTitle":"[57]插入区间","frontendQuestionId":"57","leaf":true,"level":3,"nodeType":"def","questionId":"57","status":"","title":"插入区间","titleSlug":"insert-interval"},{"formTitle":"[58]最后一个单词的长度","frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"","title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"formTitle":"[59]螺旋矩阵 II","frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"formTitle":"[60]第k个排列","frontendQuestionId":"60","leaf":true,"level":2,"nodeType":"def","questionId":"60","status":"","title":"第k个排列","titleSlug":"permutation-sequence"},{"formTitle":"[61]旋转链表","frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"","title":"旋转链表","titleSlug":"rotate-list"},{"formTitle":"[62]不同路径","frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"","title":"不同路径","titleSlug":"unique-paths"},{"formTitle":"[63]不同路径 II","frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","title":"不同路径 II","titleSlug":"unique-paths-ii"},{"formTitle":"[64]最小路径和","frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"","title":"最小路径和","titleSlug":"minimum-path-sum"},{"formTitle":"[65]有效数字","frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"","title":"有效数字","titleSlug":"valid-number"},{"formTitle":"[66]加一","frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"","title":"加一","titleSlug":"plus-one"},{"formTitle":"[67]二进制求和","frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","title":"二进制求和","titleSlug":"add-binary"},{"formTitle":"[68]文本左右对齐","frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"","title":"文本左右对齐","titleSlug":"text-justification"},{"formTitle":"[69]x 的平方根","frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","title":"x 的平方根","titleSlug":"sqrtx"},{"formTitle":"[70]爬楼梯","frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"","title":"爬楼梯","titleSlug":"climbing-stairs"},{"formTitle":"[71]简化路径","frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"","title":"简化路径","titleSlug":"simplify-path"},{"formTitle":"[72]编辑距离","frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"","title":"编辑距离","titleSlug":"edit-distance"},{"formTitle":"[73]矩阵置零","frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"","title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"formTitle":"[74]搜索二维矩阵","frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"","title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"formTitle":"[75]颜色分类","frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"ac","title":"颜色分类","titleSlug":"sort-colors"},{"formTitle":"[76]最小覆盖子串","frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"ac","title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"formTitle":"[77]组合","frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"","title":"组合","titleSlug":"combinations"},{"formTitle":"[78]子集","frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"","title":"子集","titleSlug":"subsets"},{"formTitle":"[79]单词搜索","frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"","title":"单词搜索","titleSlug":"word-search"},{"formTitle":"[80]删除排序数组中的重复项 II","frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"","title":"删除排序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"formTitle":"[81]搜索旋转排序数组 II","frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"","title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"formTitle":"[82]删除排序链表中的重复元素 II","frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"","title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"formTitle":"[83]删除排序链表中的重复元素","frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"","title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"formTitle":"[84]柱状图中最大的矩形","frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"","title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"formTitle":"[85]最大矩形","frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"","title":"最大矩形","titleSlug":"maximal-rectangle"},{"formTitle":"[86]分隔链表","frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"","title":"分隔链表","titleSlug":"partition-list"},{"formTitle":"[87]扰乱字符串","frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"","title":"扰乱字符串","titleSlug":"scramble-string"},{"formTitle":"[88]合并两个有序数组","frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"formTitle":"[89]格雷编码","frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"","title":"格雷编码","titleSlug":"gray-code"},{"formTitle":"[90]子集 II","frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"","title":"子集 II","titleSlug":"subsets-ii"},{"formTitle":"[91]解码方法","frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"","title":"解码方法","titleSlug":"decode-ways"},{"formTitle":"[92]反转链表 II","frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"","title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"formTitle":"[93]复原IP地址","frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"","title":"复原IP地址","titleSlug":"restore-ip-addresses"},{"formTitle":"[94]二叉树的中序遍历","frontendQuestionId":"94","leaf":true,"level":2,"nodeType":"def","questionId":"94","status":"","title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"formTitle":"[95]不同的二叉搜索树 II","frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"formTitle":"[96]不同的二叉搜索树","frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"formTitle":"[97]交错字符串","frontendQuestionId":"97","leaf":true,"level":3,"nodeType":"def","questionId":"97","status":"","title":"交错字符串","titleSlug":"interleaving-string"},{"formTitle":"[98]验证二叉搜索树","frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"","title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"formTitle":"[99]恢复二叉搜索树","frontendQuestionId":"99","leaf":true,"level":3,"nodeType":"def","questionId":"99","status":"","title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"formTitle":"[100]相同的树","frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","title":"相同的树","titleSlug":"same-tree"},{"formTitle":"[101]对称二叉树","frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","title":"对称二叉树","titleSlug":"symmetric-tree"},{"formTitle":"[102]二叉树的层次遍历","frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"","title":"二叉树的层次遍历","titleSlug":"binary-tree-level-order-traversal"},{"formTitle":"[103]二叉树的锯齿形层次遍历","frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"","title":"二叉树的锯齿形层次遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"formTitle":"[104]二叉树的最大深度","frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"formTitle":"[105]从前序与中序遍历序列构造二叉树","frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"formTitle":"[106]从中序与后序遍历序列构造二叉树","frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"formTitle":"[107]二叉树的层次遍历 II","frontendQuestionId":"107","leaf":true,"level":1,"nodeType":"def","questionId":"107","status":"","title":"二叉树的层次遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"formTitle":"[108]将有序数组转换为二叉搜索树","frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"","title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"formTitle":"[109]有序链表转换二叉搜索树","frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"","title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"formTitle":"[110]平衡二叉树","frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"","title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"formTitle":"[111]二叉树的最小深度","frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"formTitle":"[112]路径总和","frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","title":"路径总和","titleSlug":"path-sum"},{"formTitle":"[113]路径总和 II","frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","title":"路径总和 II","titleSlug":"path-sum-ii"},{"formTitle":"[114]二叉树展开为链表","frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"formTitle":"[115]不同的子序列","frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","title":"不同的子序列","titleSlug":"distinct-subsequences"},{"formTitle":"[116]填充每个节点的下一个右侧节点指针","frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"","title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"","title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"formTitle":"[118]杨辉三角","frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"","title":"杨辉三角","titleSlug":"pascals-triangle"},{"formTitle":"[119]杨辉三角 II","frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"","title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"formTitle":"[120]三角形最小路径和","frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"","title":"三角形最小路径和","titleSlug":"triangle"},{"formTitle":"[121]买卖股票的最佳时机","frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"","title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"formTitle":"[122]买卖股票的最佳时机 II","frontendQuestionId":"122","leaf":true,"level":1,"nodeType":"def","questionId":"122","status":"","title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"formTitle":"[123]买卖股票的最佳时机 III","frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"formTitle":"[124]二叉树中的最大路径和","frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"","title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"formTitle":"[125]验证回文串","frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"ac","title":"验证回文串","titleSlug":"valid-palindrome"},{"formTitle":"[126]单词接龙 II","frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"formTitle":"[127]单词接龙","frontendQuestionId":"127","leaf":true,"level":2,"nodeType":"def","questionId":"127","status":"","title":"单词接龙","titleSlug":"word-ladder"},{"formTitle":"[128]最长连续序列","frontendQuestionId":"128","leaf":true,"level":3,"nodeType":"def","questionId":"128","status":"","title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"formTitle":"[129]求根到叶子节点数字之和","frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","title":"求根到叶子节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"formTitle":"[130]被围绕的区域","frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"","title":"被围绕的区域","titleSlug":"surrounded-regions"},{"formTitle":"[131]分割回文串","frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","title":"分割回文串","titleSlug":"palindrome-partitioning"},{"formTitle":"[132]分割回文串 II","frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"formTitle":"[133]克隆图","frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"","title":"克隆图","titleSlug":"clone-graph"},{"formTitle":"[134]加油站","frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"","title":"加油站","titleSlug":"gas-station"},{"formTitle":"[135]分发糖果","frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"","title":"分发糖果","titleSlug":"candy"},{"formTitle":"[136]只出现一次的数字","frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"","title":"只出现一次的数字","titleSlug":"single-number"},{"formTitle":"[137]只出现一次的数字 II","frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"","title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"formTitle":"[138]复制带随机指针的链表","frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"","title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"formTitle":"[139]单词拆分","frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"","title":"单词拆分","titleSlug":"word-break"},{"formTitle":"[140]单词拆分 II","frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","title":"单词拆分 II","titleSlug":"word-break-ii"},{"formTitle":"[141]环形链表","frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"","title":"环形链表","titleSlug":"linked-list-cycle"},{"formTitle":"[142]环形链表 II","frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"","title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"formTitle":"[143]重排链表","frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"","title":"重排链表","titleSlug":"reorder-list"},{"formTitle":"[144]二叉树的前序遍历","frontendQuestionId":"144","leaf":true,"level":2,"nodeType":"def","questionId":"144","status":"","title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"formTitle":"[145]二叉树的后序遍历","frontendQuestionId":"145","leaf":true,"level":3,"nodeType":"def","questionId":"145","status":"","title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"formTitle":"[146]LRU缓存机制","frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"ac","title":"LRU缓存机制","titleSlug":"lru-cache"},{"formTitle":"[147]对链表进行插入排序","frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"","title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"formTitle":"[148]排序链表","frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"","title":"排序链表","titleSlug":"sort-list"},{"formTitle":"[149]直线上最多的点数","frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"","title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"formTitle":"[150]逆波兰表达式求值","frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"","title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"formTitle":"[151]翻转字符串里的单词","frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"formTitle":"[152]乘积最大子序列","frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","title":"乘积最大子序列","titleSlug":"maximum-product-subarray"},{"formTitle":"[153]寻找旋转排序数组中的最小值","frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"","title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"formTitle":"[154]寻找旋转排序数组中的最小值 II","frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"","title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"formTitle":"[155]最小栈","frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"","title":"最小栈","titleSlug":"min-stack"},{"formTitle":"[156]上下翻转二叉树","frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"lock","title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"formTitle":"[157]用 Read4 读取 N 个字符","frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"lock","title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"formTitle":"[158]用 Read4 读取 N 个字符 II","frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"lock","title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"formTitle":"[159]至多包含两个不同字符的最长子串","frontendQuestionId":"159","leaf":true,"level":3,"nodeType":"def","questionId":"159","status":"lock","title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"formTitle":"[160]相交链表","frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"","title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"formTitle":"[161]相隔为 1 的编辑距离","frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"lock","title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"formTitle":"[162]寻找峰值","frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"","title":"寻找峰值","titleSlug":"find-peak-element"},{"formTitle":"[163]缺失的区间","frontendQuestionId":"163","leaf":true,"level":2,"nodeType":"def","questionId":"163","status":"lock","title":"缺失的区间","titleSlug":"missing-ranges"},{"formTitle":"[164]最大间距","frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","title":"最大间距","titleSlug":"maximum-gap"},{"formTitle":"[165]比较版本号","frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"","title":"比较版本号","titleSlug":"compare-version-numbers"},{"formTitle":"[166]分数到小数","frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"formTitle":"[167]两数之和 II - 输入有序数组","frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"formTitle":"[168]Excel表列名称","frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"","title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"formTitle":"[169]求众数","frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","title":"求众数","titleSlug":"majority-element"},{"formTitle":"[170]两数之和 III - 数据结构设计","frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"lock","title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"formTitle":"[171]Excel表列序号","frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"","title":"Excel表列序号","titleSlug":"excel-sheet-column-number"},{"formTitle":"[172]阶乘后的零","frontendQuestionId":"172","leaf":true,"level":1,"nodeType":"def","questionId":"172","status":"","title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"formTitle":"[173]二叉搜索树迭代器","frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"","title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"formTitle":"[174]地下城游戏","frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","title":"地下城游戏","titleSlug":"dungeon-game"},{"formTitle":"[175]组合两个表","frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","title":"组合两个表","titleSlug":"combine-two-tables"},{"formTitle":"[176]第二高的薪水","frontendQuestionId":"176","leaf":true,"level":1,"nodeType":"def","questionId":"176","status":"","title":"第二高的薪水","titleSlug":"second-highest-salary"},{"formTitle":"[177]第N高的薪水","frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"formTitle":"[178]分数排名","frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","title":"分数排名","titleSlug":"rank-scores"},{"formTitle":"[179]最大数","frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"","title":"最大数","titleSlug":"largest-number"},{"formTitle":"[180]连续出现的数字","frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"formTitle":"[181]超过经理收入的员工","frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"formTitle":"[182]查找重复的电子邮箱","frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"formTitle":"[183]从不订购的客户","frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"formTitle":"[184]部门工资最高的员工","frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"formTitle":"[185]部门工资前三高的所有员工","frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"formTitle":"[186]翻转字符串里的单词 II","frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"lock","title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"formTitle":"[187]重复的DNA序列","frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"","title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"formTitle":"[188]买卖股票的最佳时机 IV","frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"formTitle":"[189]旋转数组","frontendQuestionId":"189","leaf":true,"level":1,"nodeType":"def","questionId":"189","status":"","title":"旋转数组","titleSlug":"rotate-array"},{"formTitle":"[190]颠倒二进制位","frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"","title":"颠倒二进制位","titleSlug":"reverse-bits"},{"formTitle":"[191]位1的个数","frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"","title":"位1的个数","titleSlug":"number-of-1-bits"},{"formTitle":"[192]统计词频","frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","title":"统计词频","titleSlug":"word-frequency"},{"formTitle":"[193]有效电话号码","frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"formTitle":"[194]转置文件","frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","title":"转置文件","titleSlug":"transpose-file"},{"formTitle":"[195]第十行","frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","title":"第十行","titleSlug":"tenth-line"},{"formTitle":"[196]删除重复的电子邮箱","frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"formTitle":"[197]上升的温度","frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","title":"上升的温度","titleSlug":"rising-temperature"},{"formTitle":"[198]打家劫舍","frontendQuestionId":"198","leaf":true,"level":1,"nodeType":"def","questionId":"198","status":"","title":"打家劫舍","titleSlug":"house-robber"},{"formTitle":"[199]二叉树的右视图","frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"","title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"formTitle":"[200]岛屿数量","frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"","title":"岛屿数量","titleSlug":"number-of-islands"},{"formTitle":"[201]数字范围按位与","frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"","title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"formTitle":"[202]快乐数","frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","title":"快乐数","titleSlug":"happy-number"},{"formTitle":"[203]移除链表元素","frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"","title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"formTitle":"[204]计数质数","frontendQuestionId":"204","leaf":true,"level":1,"nodeType":"def","questionId":"204","status":"","title":"计数质数","titleSlug":"count-primes"},{"formTitle":"[205]同构字符串","frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","title":"同构字符串","titleSlug":"isomorphic-strings"},{"formTitle":"[206]反转链表","frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"","title":"反转链表","titleSlug":"reverse-linked-list"},{"formTitle":"[207]课程表","frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","title":"课程表","titleSlug":"course-schedule"},{"formTitle":"[208]实现 Trie (前缀树)","frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"","title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"formTitle":"[209]长度最小的子数组","frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"formTitle":"[210]课程表 II","frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","title":"课程表 II","titleSlug":"course-schedule-ii"},{"formTitle":"[211]添加与搜索单词 - 数据结构设计","frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","title":"添加与搜索单词 - 数据结构设计","titleSlug":"add-and-search-word-data-structure-design"},{"formTitle":"[212]单词搜索 II","frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"","title":"单词搜索 II","titleSlug":"word-search-ii"},{"formTitle":"[213]打家劫舍 II","frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"","title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"formTitle":"[214]最短回文串","frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","title":"最短回文串","titleSlug":"shortest-palindrome"},{"formTitle":"[215]数组中的第K个最大元素","frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"","title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"formTitle":"[216]组合总和 III","frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","title":"组合总和 III","titleSlug":"combination-sum-iii"},{"formTitle":"[217]存在重复元素","frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"","title":"存在重复元素","titleSlug":"contains-duplicate"},{"formTitle":"[218]天际线问题","frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"","title":"天际线问题","titleSlug":"the-skyline-problem"},{"formTitle":"[219]存在重复元素 II","frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"","title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"formTitle":"[220]存在重复元素 III","frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"","title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"formTitle":"[221]最大正方形","frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","title":"最大正方形","titleSlug":"maximal-square"},{"formTitle":"[222]完全二叉树的节点个数","frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"formTitle":"[223]矩形面积","frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"","title":"矩形面积","titleSlug":"rectangle-area"},{"formTitle":"[224]基本计算器","frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"","title":"基本计算器","titleSlug":"basic-calculator"},{"formTitle":"[225]用队列实现栈","frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"","title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"formTitle":"[226]翻转二叉树","frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"","title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"formTitle":"[227]基本计算器 II","frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"","title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"formTitle":"[228]汇总区间","frontendQuestionId":"228","leaf":true,"level":2,"nodeType":"def","questionId":"228","status":"","title":"汇总区间","titleSlug":"summary-ranges"},{"formTitle":"[229]求众数 II","frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","title":"求众数 II","titleSlug":"majority-element-ii"},{"formTitle":"[230]二叉搜索树中第K小的元素","frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"","title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"formTitle":"[231]2的幂","frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"","title":"2的幂","titleSlug":"power-of-two"},{"formTitle":"[232]用栈实现队列","frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"","title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"formTitle":"[233]数字 1 的个数","frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"","title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"formTitle":"[234]回文链表","frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"","title":"回文链表","titleSlug":"palindrome-linked-list"},{"formTitle":"[235]二叉搜索树的最近公共祖先","frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"formTitle":"[236]二叉树的最近公共祖先","frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"formTitle":"[237]删除链表中的节点","frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"","title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"formTitle":"[238]除自身以外数组的乘积","frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"formTitle":"[239]滑动窗口最大值","frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"","title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"formTitle":"[240]搜索二维矩阵 II","frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"formTitle":"[241]为运算表达式设计优先级","frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"formTitle":"[242]有效的字母异位词","frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","title":"有效的字母异位词","titleSlug":"valid-anagram"},{"formTitle":"[243]最短单词距离","frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"lock","title":"最短单词距离","titleSlug":"shortest-word-distance"},{"formTitle":"[244]最短单词距离 II","frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"lock","title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"formTitle":"[245]最短单词距离 III","frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"lock","title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"formTitle":"[246]中心对称数","frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"lock","title":"中心对称数","titleSlug":"strobogrammatic-number"},{"formTitle":"[247]中心对称数 II","frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"lock","title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"formTitle":"[248]中心对称数 III","frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"lock","title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"formTitle":"[249]移位字符串分组","frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"lock","title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"formTitle":"[250]统计同值子树","frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"lock","title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"formTitle":"[251]展开二维向量","frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"lock","title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"formTitle":"[252]会议室","frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"lock","title":"会议室","titleSlug":"meeting-rooms"},{"formTitle":"[253]会议室 II","frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"lock","title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"formTitle":"[254]因子的组合","frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"lock","title":"因子的组合","titleSlug":"factor-combinations"},{"formTitle":"[255]验证前序遍历序列二叉搜索树","frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"lock","title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"formTitle":"[256]粉刷房子","frontendQuestionId":"256","leaf":true,"level":1,"nodeType":"def","questionId":"256","status":"lock","title":"粉刷房子","titleSlug":"paint-house"},{"formTitle":"[257]二叉树的所有路径","frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"","title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"formTitle":"[258]各位相加","frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","title":"各位相加","titleSlug":"add-digits"},{"formTitle":"[259]较小的三数之和","frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"lock","title":"较小的三数之和","titleSlug":"3sum-smaller"},{"formTitle":"[260]只出现一次的数字 III","frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"","title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"formTitle":"[261]以图判树","frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"lock","title":"以图判树","titleSlug":"graph-valid-tree"},{"formTitle":"[262]行程和用户","frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","title":"行程和用户","titleSlug":"trips-and-users"},{"formTitle":"[263]丑数","frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"","title":"丑数","titleSlug":"ugly-number"},{"formTitle":"[264]丑数 II","frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","title":"丑数 II","titleSlug":"ugly-number-ii"},{"formTitle":"[265]粉刷房子 II","frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"lock","title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"formTitle":"[266]回文排列","frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"lock","title":"回文排列","titleSlug":"palindrome-permutation"},{"formTitle":"[267]回文排列 II","frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"lock","title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"formTitle":"[268]缺失数字","frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"","title":"缺失数字","titleSlug":"missing-number"},{"formTitle":"[269]火星词典","frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"lock","title":"火星词典","titleSlug":"alien-dictionary"},{"formTitle":"[270]最接近的二叉搜索树值","frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"lock","title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"formTitle":"[271]字符串的编码与解码","frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"lock","title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"formTitle":"[272]最接近的二叉搜索树值 II","frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"lock","title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"formTitle":"[273]整数转换英文表示","frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"","title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"formTitle":"[274]H指数","frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"","title":"H指数","titleSlug":"h-index"},{"formTitle":"[275]H指数 II","frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"","title":"H指数 II","titleSlug":"h-index-ii"},{"formTitle":"[276]栅栏涂色","frontendQuestionId":"276","leaf":true,"level":1,"nodeType":"def","questionId":"276","status":"lock","title":"栅栏涂色","titleSlug":"paint-fence"},{"formTitle":"[277]搜寻名人","frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"lock","title":"搜寻名人","titleSlug":"find-the-celebrity"},{"formTitle":"[278]第一个错误的版本","frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"","title":"第一个错误的版本","titleSlug":"first-bad-version"},{"formTitle":"[279]完全平方数","frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"","title":"完全平方数","titleSlug":"perfect-squares"},{"formTitle":"[280]摆动排序","frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"lock","title":"摆动排序","titleSlug":"wiggle-sort"},{"formTitle":"[281]锯齿迭代器","frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"lock","title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"formTitle":"[282]给表达式添加运算符","frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"formTitle":"[283]移动零","frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","title":"移动零","titleSlug":"move-zeroes"},{"formTitle":"[284]顶端迭代器","frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"","title":"顶端迭代器","titleSlug":"peeking-iterator"},{"formTitle":"[285]二叉搜索树中的顺序后继","frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"lock","title":"二叉搜索树中的顺序后继","titleSlug":"inorder-successor-in-bst"},{"formTitle":"[286]墙与门","frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"lock","title":"墙与门","titleSlug":"walls-and-gates"},{"formTitle":"[287]寻找重复数","frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"formTitle":"[288]单词的唯一缩写","frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"lock","title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"formTitle":"[289]生命游戏","frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","title":"生命游戏","titleSlug":"game-of-life"},{"formTitle":"[290]单词规律","frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"ac","title":"单词规律","titleSlug":"word-pattern"},{"formTitle":"[291]单词规律 II","frontendQuestionId":"291","leaf":true,"level":3,"nodeType":"def","questionId":"291","status":"lock","title":"单词规律 II","titleSlug":"word-pattern-ii"},{"formTitle":"[292]Nim 游戏","frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"","title":"Nim 游戏","titleSlug":"nim-game"},{"formTitle":"[293]翻转游戏","frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"lock","title":"翻转游戏","titleSlug":"flip-game"},{"formTitle":"[294]翻转游戏 II","frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"lock","title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"formTitle":"[295]数据流的中位数","frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"","title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"formTitle":"[296]最佳的碰头地点","frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"lock","title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"formTitle":"[297]二叉树的序列化与反序列化","frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"","title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"formTitle":"[298]二叉树最长连续序列","frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"lock","title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"formTitle":"[299]猜数字游戏","frontendQuestionId":"299","leaf":true,"level":1,"nodeType":"def","questionId":"299","status":"","title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"formTitle":"[300]最长上升子序列","frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"","title":"最长上升子序列","titleSlug":"longest-increasing-subsequence"},{"formTitle":"[301]删除无效的括号","frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"formTitle":"[302]包含全部黑色像素的最小矩形","frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"lock","title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"formTitle":"[303]区域和检索 - 数组不可变","frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"formTitle":"[304]二维区域和检索 - 矩阵不可变","frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"formTitle":"[305]岛屿数量 II","frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"lock","title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"formTitle":"[306]累加数","frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","title":"累加数","titleSlug":"additive-number"},{"formTitle":"[307]区域和检索 - 数组可修改","frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"","title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"formTitle":"[308]二维区域和检索 - 可变","frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"lock","title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"formTitle":"[309]最佳买卖股票时机含冷冻期","frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"formTitle":"[310]最小高度树","frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","title":"最小高度树","titleSlug":"minimum-height-trees"},{"formTitle":"[311]稀疏矩阵的乘法","frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"lock","title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"formTitle":"[312]戳气球","frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","title":"戳气球","titleSlug":"burst-balloons"},{"formTitle":"[313]超级丑数","frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"","title":"超级丑数","titleSlug":"super-ugly-number"},{"formTitle":"[314]二叉树的垂直遍历","frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"lock","title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"formTitle":"[315]计算右侧小于当前元素的个数","frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"","title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"formTitle":"[316]去除重复字母","frontendQuestionId":"316","leaf":true,"level":3,"nodeType":"def","questionId":"316","status":"","title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"formTitle":"[317]离建筑物最近的距离","frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"lock","title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"formTitle":"[318]最大单词长度乘积","frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"formTitle":"[319]灯泡开关","frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"","title":"灯泡开关","titleSlug":"bulb-switcher"},{"formTitle":"[320]列举单词的全部缩写","frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"lock","title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"formTitle":"[321]拼接最大数","frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","title":"拼接最大数","titleSlug":"create-maximum-number"},{"formTitle":"[322]零钱兑换","frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"","title":"零钱兑换","titleSlug":"coin-change"},{"formTitle":"[323]无向图中连通分量的数目","frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"lock","title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"formTitle":"[324]摆动排序 II","frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"","title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"formTitle":"[325]和等于 k 的最长子数组长度","frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"lock","title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"formTitle":"[326]3的幂","frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"","title":"3的幂","titleSlug":"power-of-three"},{"formTitle":"[327]区间和的个数","frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","title":"区间和的个数","titleSlug":"count-of-range-sum"},{"formTitle":"[328]奇偶链表","frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"","title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"formTitle":"[329]矩阵中的最长递增路径","frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"formTitle":"[330]按要求补齐数组","frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","title":"按要求补齐数组","titleSlug":"patching-array"},{"formTitle":"[331]验证二叉树的前序序列化","frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"","title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"formTitle":"[332]重新安排行程","frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"formTitle":"[333]最大 BST 子树","frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"lock","title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"formTitle":"[334]递增的三元子序列","frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"formTitle":"[335]路径交叉","frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","title":"路径交叉","titleSlug":"self-crossing"},{"formTitle":"[336]回文对","frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","title":"回文对","titleSlug":"palindrome-pairs"},{"formTitle":"[337]打家劫舍 III","frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"formTitle":"[338]比特位计数","frontendQuestionId":"338","leaf":true,"level":2,"nodeType":"def","questionId":"338","status":"","title":"比特位计数","titleSlug":"counting-bits"},{"formTitle":"[339]嵌套列表权重和","frontendQuestionId":"339","leaf":true,"level":1,"nodeType":"def","questionId":"339","status":"lock","title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"formTitle":"[340]至多包含 K 个不同字符的最长子串","frontendQuestionId":"340","leaf":true,"level":3,"nodeType":"def","questionId":"340","status":"lock","title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"formTitle":"[341]扁平化嵌套列表迭代器","frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"","title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"formTitle":"[342]4的幂","frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"","title":"4的幂","titleSlug":"power-of-four"},{"formTitle":"[343]整数拆分","frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"","title":"整数拆分","titleSlug":"integer-break"},{"formTitle":"[344]反转字符串","frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","title":"反转字符串","titleSlug":"reverse-string"},{"formTitle":"[345]反转字符串中的元音字母","frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"formTitle":"[346]数据流中的移动平均值","frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"lock","title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"formTitle":"[347]前 K 个高频元素","frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"","title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"formTitle":"[348]判定井字棋胜负","frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"lock","title":"判定井字棋胜负","titleSlug":"design-tic-tac-toe"},{"formTitle":"[349]两个数组的交集","frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"formTitle":"[350]两个数组的交集 II","frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"formTitle":"[351]安卓系统手势解锁","frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"lock","title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"formTitle":"[352]将数据流变为多个不相交区间","frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"","title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"formTitle":"[353]贪吃蛇","frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"lock","title":"贪吃蛇","titleSlug":"design-snake-game"},{"formTitle":"[354]俄罗斯套娃信封问题","frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"formTitle":"[355]设计推特","frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","title":"设计推特","titleSlug":"design-twitter"},{"formTitle":"[356]直线镜像","frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"lock","title":"直线镜像","titleSlug":"line-reflection"},{"formTitle":"[357]计算各个位数不同的数字个数","frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"formTitle":"[358]K 距离间隔重排字符串","frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"lock","title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"formTitle":"[359]日志速率限制器","frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"lock","title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"formTitle":"[360]有序转化数组","frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"lock","title":"有序转化数组","titleSlug":"sort-transformed-array"},{"formTitle":"[361]轰炸敌人","frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"lock","title":"轰炸敌人","titleSlug":"bomb-enemy"},{"formTitle":"[362]敲击计数器","frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"lock","title":"敲击计数器","titleSlug":"design-hit-counter"},{"formTitle":"[363]矩形区域不超过 K 的最大数值和","frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"","title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"formTitle":"[364]加权嵌套序列和 II","frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"lock","title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"formTitle":"[365]水壶问题","frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","title":"水壶问题","titleSlug":"water-and-jug-problem"},{"formTitle":"[366]寻找完全二叉树的叶子节点","frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"lock","title":"寻找完全二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"formTitle":"[367]有效的完全平方数","frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"formTitle":"[368]最大整除子集","frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"","title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"formTitle":"[369]给单链表加一","frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"lock","title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"formTitle":"[370]区间加法","frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"lock","title":"区间加法","titleSlug":"range-addition"},{"formTitle":"[371]两整数之和","frontendQuestionId":"371","leaf":true,"level":1,"nodeType":"def","questionId":"371","status":"","title":"两整数之和","titleSlug":"sum-of-two-integers"},{"formTitle":"[372]超级次方","frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","title":"超级次方","titleSlug":"super-pow"},{"formTitle":"[373]查找和最小的K对数字","frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"","title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"formTitle":"[374]猜数字大小","frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"","title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"formTitle":"[375]猜数字大小 II","frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"formTitle":"[376]摆动序列","frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"","title":"摆动序列","titleSlug":"wiggle-subsequence"},{"formTitle":"[377]组合总和 Ⅳ","frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"","title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"formTitle":"[378]有序矩阵中第K小的元素","frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"","title":"有序矩阵中第K小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"formTitle":"[379]电话目录管理系统","frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"lock","title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"formTitle":"[380]常数时间插入、删除和获取随机元素","frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"","title":"常数时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"formTitle":"[382]链表随机节点","frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","title":"链表随机节点","titleSlug":"linked-list-random-node"},{"formTitle":"[383]赎金信","frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"","title":"赎金信","titleSlug":"ransom-note"},{"formTitle":"[384]打乱数组","frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"","title":"打乱数组","titleSlug":"shuffle-an-array"},{"formTitle":"[385]迷你语法分析器","frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"","title":"迷你语法分析器","titleSlug":"mini-parser"},{"formTitle":"[386]字典序排数","frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","title":"字典序排数","titleSlug":"lexicographical-numbers"},{"formTitle":"[387]字符串中的第一个唯一字符","frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"","title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"formTitle":"[388]文件的最长绝对路径","frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"formTitle":"[389]找不同","frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","title":"找不同","titleSlug":"find-the-difference"},{"formTitle":"[390]消除游戏","frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","title":"消除游戏","titleSlug":"elimination-game"},{"formTitle":"[391]完美矩形","frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","title":"完美矩形","titleSlug":"perfect-rectangle"},{"formTitle":"[392]判断子序列","frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"","title":"判断子序列","titleSlug":"is-subsequence"},{"formTitle":"[393]UTF-8 编码验证","frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"formTitle":"[394]字符串解码","frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"","title":"字符串解码","titleSlug":"decode-string"},{"formTitle":"[395]至少有K个重复字符的最长子串","frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","title":"至少有K个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"formTitle":"[396]旋转函数","frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","title":"旋转函数","titleSlug":"rotate-function"},{"formTitle":"[397]整数替换","frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","title":"整数替换","titleSlug":"integer-replacement"},{"formTitle":"[398]随机数索引","frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","title":"随机数索引","titleSlug":"random-pick-index"},{"formTitle":"[399]除法求值","frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","title":"除法求值","titleSlug":"evaluate-division"},{"formTitle":"[400]第N个数字","frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"","title":"第N个数字","titleSlug":"nth-digit"},{"formTitle":"[401]二进制手表","frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","title":"二进制手表","titleSlug":"binary-watch"},{"formTitle":"[402]移掉K位数字","frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"","title":"移掉K位数字","titleSlug":"remove-k-digits"},{"formTitle":"[403]青蛙过河","frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"","title":"青蛙过河","titleSlug":"frog-jump"},{"formTitle":"[404]左叶子之和","frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"","title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"formTitle":"[405]数字转换为十六进制数","frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"","title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"formTitle":"[406]根据身高重建队列","frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"formTitle":"[407]接雨水 II","frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"formTitle":"[408]有效单词缩写","frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"lock","title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"formTitle":"[409]最长回文串","frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","title":"最长回文串","titleSlug":"longest-palindrome"},{"formTitle":"[410]分割数组的最大值","frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"formTitle":"[411]最短特异单词缩写","frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"lock","title":"最短特异单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"formTitle":"[412]Fizz Buzz","frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"","title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"formTitle":"[413]等差数列划分","frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"","title":"等差数列划分","titleSlug":"arithmetic-slices"},{"formTitle":"[414]第三大的数","frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"","title":"第三大的数","titleSlug":"third-maximum-number"},{"formTitle":"[415]字符串相加","frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","title":"字符串相加","titleSlug":"add-strings"},{"formTitle":"[416]分割等和子集","frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"","title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"formTitle":"[417]太平洋大西洋水流问题","frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"","title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"formTitle":"[418]屏幕可显示句子的数量","frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"lock","title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"formTitle":"[419]甲板上的战舰","frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"formTitle":"[420]强密码检验器","frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","title":"强密码检验器","titleSlug":"strong-password-checker"},{"formTitle":"[421]数组中两个数的最大异或值","frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"","title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"formTitle":"[422]有效的单词方块","frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"lock","title":"有效的单词方块","titleSlug":"valid-word-square"},{"formTitle":"[423]从英文中重建数字","frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"formTitle":"[424]替换后的最长重复字符","frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"","title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"formTitle":"[425]单词方块","frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"lock","title":"单词方块","titleSlug":"word-squares"},{"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"lock","title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"formTitle":"[427]建立四叉树","frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","title":"建立四叉树","titleSlug":"construct-quad-tree"},{"formTitle":"[428]序列化和反序列化 N 叉树","frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"lock","title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"formTitle":"[429]N叉树的层序遍历","frontendQuestionId":"429","leaf":true,"level":1,"nodeType":"def","questionId":"764","status":"","title":"N叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"formTitle":"[430]扁平化多级双向链表","frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"","title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"formTitle":"[431]将 N 叉树编码为二叉树","frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"lock","title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"formTitle":"[432]全 O(1) 的数据结构","frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"formTitle":"[433]最小基因变化","frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"formTitle":"[434]字符串中的单词数","frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"","title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"formTitle":"[435]无重叠区间","frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"","title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"formTitle":"[436]寻找右区间","frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"","title":"寻找右区间","titleSlug":"find-right-interval"},{"formTitle":"[437]路径总和 III","frontendQuestionId":"437","leaf":true,"level":1,"nodeType":"def","questionId":"437","status":"","title":"路径总和 III","titleSlug":"path-sum-iii"},{"formTitle":"[438]找到字符串中所有字母异位词","frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"formTitle":"[439]三元表达式解析器","frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"lock","title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"formTitle":"[440]字典序的第K小数字","frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"formTitle":"[441]排列硬币","frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"","title":"排列硬币","titleSlug":"arranging-coins"},{"formTitle":"[442]数组中重复的数据","frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"formTitle":"[443]压缩字符串","frontendQuestionId":"443","leaf":true,"level":1,"nodeType":"def","questionId":"443","status":"","title":"压缩字符串","titleSlug":"string-compression"},{"formTitle":"[444]序列重建","frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"lock","title":"序列重建","titleSlug":"sequence-reconstruction"},{"formTitle":"[445]两数相加 II","frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"","title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"formTitle":"[446]等差数列划分 II - 子序列","frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"","title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"formTitle":"[447]回旋镖的数量","frontendQuestionId":"447","leaf":true,"level":1,"nodeType":"def","questionId":"447","status":"","title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"formTitle":"[448]找到所有数组中消失的数字","frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"formTitle":"[449]序列化和反序列化二叉搜索树","frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"formTitle":"[450]删除二叉搜索树中的节点","frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"formTitle":"[451]根据字符出现频率排序","frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"formTitle":"[452]用最少数量的箭引爆气球","frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"","title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"formTitle":"[453]最小移动次数使数组元素相等","frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","title":"最小移动次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"formTitle":"[454]四数相加 II","frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"","title":"四数相加 II","titleSlug":"4sum-ii"},{"formTitle":"[455]分发饼干","frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"","title":"分发饼干","titleSlug":"assign-cookies"},{"formTitle":"[456]132模式","frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"","title":"132模式","titleSlug":"132-pattern"},{"formTitle":"[457]环形数组循环","frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"","title":"环形数组循环","titleSlug":"circular-array-loop"},{"formTitle":"[458]可怜的小猪","frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","title":"可怜的小猪","titleSlug":"poor-pigs"},{"formTitle":"[459]重复的子字符串","frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"formTitle":"[460]LFU缓存","frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","title":"LFU缓存","titleSlug":"lfu-cache"},{"formTitle":"[461]汉明距离","frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"","title":"汉明距离","titleSlug":"hamming-distance"},{"formTitle":"[462]最少移动次数使数组元素相等 II","frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"formTitle":"[463]岛屿的周长","frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","title":"岛屿的周长","titleSlug":"island-perimeter"},{"formTitle":"[464]我能赢吗","frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","title":"我能赢吗","titleSlug":"can-i-win"},{"formTitle":"[465]最优账单平衡","frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"lock","title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"formTitle":"[466]统计重复个数","frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","title":"统计重复个数","titleSlug":"count-the-repetitions"},{"formTitle":"[467]环绕字符串中唯一的子字符串","frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"formTitle":"[468]验证IP地址","frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","title":"验证IP地址","titleSlug":"validate-ip-address"},{"formTitle":"[469]凸多边形","frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"lock","title":"凸多边形","titleSlug":"convex-polygon"},{"formTitle":"[470]用 Rand7() 实现 Rand10()","frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"","title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"formTitle":"[471]编码最短长度的字符串","frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"lock","title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"formTitle":"[472]连接词","frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","title":"连接词","titleSlug":"concatenated-words"},{"formTitle":"[473]火柴拼正方形","frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"formTitle":"[474]一和零","frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"","title":"一和零","titleSlug":"ones-and-zeroes"},{"formTitle":"[475]供暖器","frontendQuestionId":"475","leaf":true,"level":1,"nodeType":"def","questionId":"475","status":"","title":"供暖器","titleSlug":"heaters"},{"formTitle":"[476]数字的补数","frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","title":"数字的补数","titleSlug":"number-complement"},{"formTitle":"[477]汉明距离总和","frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"","title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"formTitle":"[478]在圆内随机生成点","frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"formTitle":"[479]最大回文数乘积","frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"","title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"formTitle":"[480]滑动窗口中位数","frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"","title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"formTitle":"[481]神奇字符串","frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","title":"神奇字符串","titleSlug":"magical-string"},{"formTitle":"[482]密钥格式化","frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"","title":"密钥格式化","titleSlug":"license-key-formatting"},{"formTitle":"[483]最小好进制","frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"","title":"最小好进制","titleSlug":"smallest-good-base"},{"formTitle":"[484]寻找排列","frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"lock","title":"寻找排列","titleSlug":"find-permutation"},{"formTitle":"[485]最大连续1的个数","frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","title":"最大连续1的个数","titleSlug":"max-consecutive-ones"},{"formTitle":"[486]预测赢家","frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"","title":"预测赢家","titleSlug":"predict-the-winner"},{"formTitle":"[487]最大连续1的个数 II","frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"lock","title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"formTitle":"[488]祖玛游戏","frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","title":"祖玛游戏","titleSlug":"zuma-game"},{"formTitle":"[489]扫地机器人","frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"lock","title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"formTitle":"[490]迷宫","frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"lock","title":"迷宫","titleSlug":"the-maze"},{"formTitle":"[491]递增子序列","frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"","title":"递增子序列","titleSlug":"increasing-subsequences"},{"formTitle":"[492]构造矩形","frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","title":"构造矩形","titleSlug":"construct-the-rectangle"},{"formTitle":"[493]翻转对","frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","title":"翻转对","titleSlug":"reverse-pairs"},{"formTitle":"[494]目标和","frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"","title":"目标和","titleSlug":"target-sum"},{"formTitle":"[495]提莫攻击","frontendQuestionId":"495","leaf":true,"level":2,"nodeType":"def","questionId":"495","status":"","title":"提莫攻击","titleSlug":"teemo-attacking"},{"formTitle":"[496]下一个更大元素 I","frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"","title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"formTitle":"[497]非重叠矩形中的随机点","frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"formTitle":"[498]对角线遍历","frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","title":"对角线遍历","titleSlug":"diagonal-traverse"},{"formTitle":"[499]迷宫 III","frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"lock","title":"迷宫 III","titleSlug":"the-maze-iii"},{"formTitle":"[500]键盘行","frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","title":"键盘行","titleSlug":"keyboard-row"},{"formTitle":"[501]二叉搜索树中的众数","frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"formTitle":"[502]IPO","frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"","title":"IPO","titleSlug":"ipo"},{"formTitle":"[503]下一个更大元素 II","frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"","title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"formTitle":"[504]七进制数","frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","title":"七进制数","titleSlug":"base-7"},{"formTitle":"[505]迷宫 II","frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"lock","title":"迷宫 II","titleSlug":"the-maze-ii"},{"formTitle":"[506]相对名次","frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","title":"相对名次","titleSlug":"relative-ranks"},{"formTitle":"[507]完美数","frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","title":"完美数","titleSlug":"perfect-number"},{"formTitle":"[508]出现次数最多的子树元素和","frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"formTitle":"[509]斐波那契数","frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"ac","title":"斐波那契数","titleSlug":"fibonacci-number"},{"formTitle":"[510]二叉搜索树中的中序后继 II","frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"lock","title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"formTitle":"[511]游戏玩法分析 I","frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"lock","title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"formTitle":"[512]游戏玩法分析 II","frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"lock","title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"formTitle":"[513]找树左下角的值","frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"formTitle":"[514]自由之路","frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","title":"自由之路","titleSlug":"freedom-trail"},{"formTitle":"[515]在每个树行中找最大值","frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"formTitle":"[516]最长回文子序列","frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"","title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"formTitle":"[517]超级洗衣机","frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"","title":"超级洗衣机","titleSlug":"super-washing-machines"},{"formTitle":"[518]零钱兑换 II","frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"","title":"零钱兑换 II","titleSlug":"coin-change-2"},{"formTitle":"[519]随机翻转矩阵","frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"formTitle":"[520]检测大写字母","frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","title":"检测大写字母","titleSlug":"detect-capital"},{"formTitle":"[521]最长特殊序列 Ⅰ","frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"formTitle":"[522]最长特殊序列 II","frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"formTitle":"[523]连续的子数组和","frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"","title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"formTitle":"[524]通过删除字母匹配到字典里最长单词","frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"","title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"formTitle":"[525]连续数组","frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"","title":"连续数组","titleSlug":"contiguous-array"},{"formTitle":"[526]优美的排列","frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"","title":"优美的排列","titleSlug":"beautiful-arrangement"},{"formTitle":"[527]单词缩写","frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"lock","title":"单词缩写","titleSlug":"word-abbreviation"},{"formTitle":"[528]按权重随机选择","frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"","title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"formTitle":"[529]扫雷游戏","frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","title":"扫雷游戏","titleSlug":"minesweeper"},{"formTitle":"[530]二叉搜索树的最小绝对差","frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"","title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"formTitle":"[531]孤独像素 I","frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"lock","title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"formTitle":"[532]数组中的K-diff数对","frontendQuestionId":"532","leaf":true,"level":1,"nodeType":"def","questionId":"532","status":"","title":"数组中的K-diff数对","titleSlug":"k-diff-pairs-in-an-array"},{"formTitle":"[533]孤独像素 II","frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"lock","title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"formTitle":"[534]游戏玩法分析 III","frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"lock","title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"formTitle":"[535]TinyURL 的加密与解密","frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"formTitle":"[536]从字符串生成二叉树","frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"lock","title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"formTitle":"[537]复数乘法","frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","title":"复数乘法","titleSlug":"complex-number-multiplication"},{"formTitle":"[538]把二叉搜索树转换为累加树","frontendQuestionId":"538","leaf":true,"level":1,"nodeType":"def","questionId":"538","status":"","title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"formTitle":"[539]最小时间差","frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","title":"最小时间差","titleSlug":"minimum-time-difference"},{"formTitle":"[540]有序数组中的单一元素","frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"","title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"formTitle":"[541]反转字符串 II","frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"","title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"formTitle":"[542]01 矩阵","frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"","title":"01 矩阵","titleSlug":"01-matrix"},{"formTitle":"[543]二叉树的直径","frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"formTitle":"[544]输出比赛匹配对","frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"lock","title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"formTitle":"[545]二叉树的边界","frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"lock","title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"formTitle":"[546]移除盒子","frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","title":"移除盒子","titleSlug":"remove-boxes"},{"formTitle":"[547]朋友圈","frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"","title":"朋友圈","titleSlug":"friend-circles"},{"formTitle":"[548]将数组分割成和相等的子数组","frontendQuestionId":"548","leaf":true,"level":2,"nodeType":"def","questionId":"548","status":"lock","title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"formTitle":"[549]二叉树中最长的连续序列","frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"lock","title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"formTitle":"[550]游戏玩法分析 IV","frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"lock","title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"formTitle":"[551]学生出勤记录 I","frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"","title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"formTitle":"[552]学生出勤记录 II","frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"","title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"formTitle":"[553]最优除法","frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","title":"最优除法","titleSlug":"optimal-division"},{"formTitle":"[554]砖墙","frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"","title":"砖墙","titleSlug":"brick-wall"},{"formTitle":"[555]分割连接字符串","frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"lock","title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"formTitle":"[556]下一个更大元素 III","frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"formTitle":"[557]反转字符串中的单词 III","frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"","title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"formTitle":"[558]四叉树交集","frontendQuestionId":"558","leaf":true,"level":1,"nodeType":"def","questionId":"773","status":"","title":"四叉树交集","titleSlug":"quad-tree-intersection"},{"formTitle":"[559]N叉树的最大深度","frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","title":"N叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"formTitle":"[560]和为K的子数组","frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","title":"和为K的子数组","titleSlug":"subarray-sum-equals-k"},{"formTitle":"[561]数组拆分 I","frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"","title":"数组拆分 I","titleSlug":"array-partition-i"},{"formTitle":"[562]矩阵中最长的连续1线段","frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"lock","title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"formTitle":"[563]二叉树的坡度","frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"formTitle":"[564]寻找最近的回文数","frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"","title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"formTitle":"[565]数组嵌套","frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","title":"数组嵌套","titleSlug":"array-nesting"},{"formTitle":"[566]重塑矩阵","frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"","title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"formTitle":"[567]字符串的排列","frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"","title":"字符串的排列","titleSlug":"permutation-in-string"},{"formTitle":"[568]最大休假天数","frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"lock","title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"formTitle":"[569]员工薪水中位数","frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"lock","title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"formTitle":"[570]至少有5名直接下属的经理","frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"lock","title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"formTitle":"[571]给定数字的频率查询中位数","frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"lock","title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"formTitle":"[572]另一个树的子树","frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"","title":"另一个树的子树","titleSlug":"subtree-of-another-tree"},{"formTitle":"[573]松鼠模拟","frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"lock","title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"formTitle":"[574]当选者","frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"lock","title":"当选者","titleSlug":"winning-candidate"},{"formTitle":"[575]分糖果","frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","title":"分糖果","titleSlug":"distribute-candies"},{"formTitle":"[576]出界的路径数","frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"","title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"formTitle":"[577]员工奖金","frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"lock","title":"员工奖金","titleSlug":"employee-bonus"},{"formTitle":"[578]查询回答率最高的问题","frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"lock","title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"formTitle":"[579]查询员工的累计薪水","frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"lock","title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"formTitle":"[580]统计各专业学生人数","frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"lock","title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"formTitle":"[581]最短无序连续子数组","frontendQuestionId":"581","leaf":true,"level":1,"nodeType":"def","questionId":"581","status":"","title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"formTitle":"[582]杀死进程","frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"lock","title":"杀死进程","titleSlug":"kill-process"},{"formTitle":"[583]两个字符串的删除操作","frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"","title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"formTitle":"[584]寻找用户推荐人","frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"lock","title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"formTitle":"[585]2016年的投资","frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"lock","title":"2016年的投资","titleSlug":"investments-in-2016"},{"formTitle":"[586]订单最多的客户","frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"lock","title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"formTitle":"[587]安装栅栏","frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","title":"安装栅栏","titleSlug":"erect-the-fence"},{"formTitle":"[588]设计内存文件系统","frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"lock","title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"formTitle":"[589]N叉树的前序遍历","frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","title":"N叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"formTitle":"[590]N叉树的后序遍历","frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","title":"N叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"formTitle":"[591]标签验证器","frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"","title":"标签验证器","titleSlug":"tag-validator"},{"formTitle":"[592]分数加减运算","frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"formTitle":"[593]有效的正方形","frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","title":"有效的正方形","titleSlug":"valid-square"},{"formTitle":"[594]最长和谐子序列","frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"formTitle":"[595]大的国家","frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","title":"大的国家","titleSlug":"big-countries"},{"formTitle":"[596]超过5名学生的课","frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"formTitle":"[597]好友申请 I ：总体通过率","frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"lock","title":"好友申请 I ：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"formTitle":"[598]范围求和 II","frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","title":"范围求和 II","titleSlug":"range-addition-ii"},{"formTitle":"[599]两个列表的最小索引总和","frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"","title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"formTitle":"[600]不含连续1的非负整数","frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"","title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"formTitle":"[601]体育馆的人流量","frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"formTitle":"[602]好友申请 II ：谁有最多的好友","frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"lock","title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"formTitle":"[603]连续空余座位","frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"lock","title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"formTitle":"[604]迭代压缩字符串","frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"lock","title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"formTitle":"[605]种花问题","frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","title":"种花问题","titleSlug":"can-place-flowers"},{"formTitle":"[606]根据二叉树创建字符串","frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"formTitle":"[607]销售员","frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"lock","title":"销售员","titleSlug":"sales-person"},{"formTitle":"[608]树节点","frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"lock","title":"树节点","titleSlug":"tree-node"},{"formTitle":"[609]在系统中查找重复文件","frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"formTitle":"[610]判断三角形","frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"lock","title":"判断三角形","titleSlug":"triangle-judgement"},{"formTitle":"[611]有效三角形的个数","frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"","title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"formTitle":"[612]平面上的最近距离","frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"lock","title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"formTitle":"[613]直线上的最近距离","frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"lock","title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"formTitle":"[614]二级关注者","frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"lock","title":"二级关注者","titleSlug":"second-degree-follower"},{"formTitle":"[615]平均工资：部门与公司比较","frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"lock","title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"formTitle":"[616]给字符串添加加粗标签","frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"lock","title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"formTitle":"[617]合并二叉树","frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"","title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"formTitle":"[618]学生地理信息报告","frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"lock","title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"formTitle":"[619]只出现一次的最大数字","frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"lock","title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"formTitle":"[620]有趣的电影","frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","title":"有趣的电影","titleSlug":"not-boring-movies"},{"formTitle":"[621]任务调度器","frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","title":"任务调度器","titleSlug":"task-scheduler"},{"formTitle":"[622]设计循环队列","frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"","title":"设计循环队列","titleSlug":"design-circular-queue"},{"formTitle":"[623]在二叉树中增加一行","frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"formTitle":"[624]数组列表中的最大距离","frontendQuestionId":"624","leaf":true,"level":1,"nodeType":"def","questionId":"624","status":"lock","title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"formTitle":"[625]最小因式分解","frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"lock","title":"最小因式分解","titleSlug":"minimum-factorization"},{"formTitle":"[626]换座位","frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","title":"换座位","titleSlug":"exchange-seats"},{"formTitle":"[627]交换工资","frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","title":"交换工资","titleSlug":"swap-salary"},{"formTitle":"[628]三个数的最大乘积","frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"","title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"formTitle":"[629]K个逆序对数组","frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"formTitle":"[630]课程表 III","frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","title":"课程表 III","titleSlug":"course-schedule-iii"},{"formTitle":"[631]设计 Excel 求和公式","frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"lock","title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"formTitle":"[632]最小区间","frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"formTitle":"[633]平方数之和","frontendQuestionId":"633","leaf":true,"level":1,"nodeType":"def","questionId":"633","status":"","title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"formTitle":"[634]寻找数组的错位排列","frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"lock","title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"formTitle":"[635]设计日志存储系统","frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"lock","title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"formTitle":"[636]函数的独占时间","frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"","title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"formTitle":"[637]二叉树的层平均值","frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"formTitle":"[638]大礼包","frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","title":"大礼包","titleSlug":"shopping-offers"},{"formTitle":"[639]解码方法 2","frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"","title":"解码方法 2","titleSlug":"decode-ways-ii"},{"formTitle":"[640]求解方程","frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","title":"求解方程","titleSlug":"solve-the-equation"},{"formTitle":"[641]设计循环双端队列","frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"formTitle":"[642]设计搜索自动补全系统","frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"lock","title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"formTitle":"[643]子数组最大平均数 I","frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"formTitle":"[644]最大平均子段和 II","frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"lock","title":"最大平均子段和 II","titleSlug":"maximum-average-subarray-ii"},{"formTitle":"[645]错误的集合","frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"","title":"错误的集合","titleSlug":"set-mismatch"},{"formTitle":"[646]最长数对链","frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"formTitle":"[647]回文子串","frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","title":"回文子串","titleSlug":"palindromic-substrings"},{"formTitle":"[648]单词替换","frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","title":"单词替换","titleSlug":"replace-words"},{"formTitle":"[649]Dota2 参议院","frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","title":"Dota2 参议院","titleSlug":"dota2-senate"},{"formTitle":"[650]只有两个键的键盘","frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"","title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"formTitle":"[651]4键键盘","frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"lock","title":"4键键盘","titleSlug":"4-keys-keyboard"},{"formTitle":"[652]寻找重复的子树","frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"","title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"formTitle":"[653]两数之和 IV - 输入 BST","frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"formTitle":"[654]最大二叉树","frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"formTitle":"[655]输出二叉树","frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","title":"输出二叉树","titleSlug":"print-binary-tree"},{"formTitle":"[656]金币路径","frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"lock","title":"金币路径","titleSlug":"coin-path"},{"formTitle":"[657]机器人能否返回原点","frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"formTitle":"[658]找到 K 个最接近的元素","frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"formTitle":"[659]分割数组为连续子序列","frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"formTitle":"[660]移除 9","frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"lock","title":"移除 9","titleSlug":"remove-9"},{"formTitle":"[661]图片平滑器","frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","title":"图片平滑器","titleSlug":"image-smoother"},{"formTitle":"[662]二叉树最大宽度","frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"formTitle":"[663]均匀树划分","frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"lock","title":"均匀树划分","titleSlug":"equal-tree-partition"},{"formTitle":"[664]奇怪的打印机","frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"","title":"奇怪的打印机","titleSlug":"strange-printer"},{"formTitle":"[665]非递减数列","frontendQuestionId":"665","leaf":true,"level":1,"nodeType":"def","questionId":"665","status":"","title":"非递减数列","titleSlug":"non-decreasing-array"},{"formTitle":"[666]路径和 IV","frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"lock","title":"路径和 IV","titleSlug":"path-sum-iv"},{"formTitle":"[667]优美的排列 II","frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"formTitle":"[668]乘法表中第k小的数","frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"formTitle":"[669]修剪二叉搜索树","frontendQuestionId":"669","leaf":true,"level":1,"nodeType":"def","questionId":"669","status":"","title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"formTitle":"[670]最大交换","frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","title":"最大交换","titleSlug":"maximum-swap"},{"formTitle":"[671]二叉树中第二小的节点","frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"","title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"formTitle":"[672]灯泡开关 Ⅱ","frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"formTitle":"[673]最长递增子序列的个数","frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"","title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"formTitle":"[674]最长连续递增序列","frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"formTitle":"[675]为高尔夫比赛砍树","frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"formTitle":"[676]实现一个魔法字典","frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"formTitle":"[677]键值映射","frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","title":"键值映射","titleSlug":"map-sum-pairs"},{"formTitle":"[678]有效的括号字符串","frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"","title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"formTitle":"[679]24 点游戏","frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","title":"24 点游戏","titleSlug":"24-game"},{"formTitle":"[680]验证回文字符串 Ⅱ","frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"formTitle":"[681]最近时刻","frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"lock","title":"最近时刻","titleSlug":"next-closest-time"},{"formTitle":"[682]棒球比赛","frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"","title":"棒球比赛","titleSlug":"baseball-game"},{"formTitle":"[683]K 个空花盆","frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"lock","title":"K 个空花盆","titleSlug":"k-empty-slots"},{"formTitle":"[684]冗余连接","frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","title":"冗余连接","titleSlug":"redundant-connection"},{"formTitle":"[685]冗余连接 II","frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"formTitle":"[686]重复叠加字符串匹配","frontendQuestionId":"686","leaf":true,"level":1,"nodeType":"def","questionId":"686","status":"","title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"formTitle":"[687]最长同值路径","frontendQuestionId":"687","leaf":true,"level":1,"nodeType":"def","questionId":"687","status":"","title":"最长同值路径","titleSlug":"longest-univalue-path"},{"formTitle":"[688]“马”在棋盘上的概率","frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"formTitle":"[689]三个无重叠子数组的最大和","frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"formTitle":"[690]员工的重要性","frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"","title":"员工的重要性","titleSlug":"employee-importance"},{"formTitle":"[691]贴纸拼词","frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"formTitle":"[692]前K个高频单词","frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"","title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"formTitle":"[693]交替位二进制数","frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"formTitle":"[694]不同岛屿的数量","frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"lock","title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"formTitle":"[695]岛屿的最大面积","frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"","title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"formTitle":"[696]计数二进制子串","frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"formTitle":"[697]数组的度","frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","title":"数组的度","titleSlug":"degree-of-an-array"},{"formTitle":"[698]划分为k个相等的子集","frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"formTitle":"[699]掉落的方块","frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","title":"掉落的方块","titleSlug":"falling-squares"},{"formTitle":"[700]二叉搜索树中的搜索","frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"formTitle":"[701]二叉搜索树中的插入操作","frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"formTitle":"[702]搜索长度未知的有序数组","frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"lock","title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"formTitle":"[703]数据流中的第K大元素","frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","title":"数据流中的第K大元素","titleSlug":"kth-largest-element-in-a-stream"},{"formTitle":"[704]二分查找","frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"","title":"二分查找","titleSlug":"binary-search"},{"formTitle":"[705]设计哈希集合","frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"","title":"设计哈希集合","titleSlug":"design-hashset"},{"formTitle":"[706]设计哈希映射","frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"","title":"设计哈希映射","titleSlug":"design-hashmap"},{"formTitle":"[707]设计链表","frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"","title":"设计链表","titleSlug":"design-linked-list"},{"formTitle":"[708]循环有序列表的插入","frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"lock","title":"循环有序列表的插入","titleSlug":"insert-into-a-cyclic-sorted-list"},{"formTitle":"[709]转换成小写字母","frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","title":"转换成小写字母","titleSlug":"to-lower-case"},{"formTitle":"[710]黑名单中的随机数","frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"formTitle":"[711]不同岛屿的数量 II","frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"lock","title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"formTitle":"[712]两个字符串的最小ASCII删除和","frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"formTitle":"[713]乘积小于K的子数组","frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"","title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"formTitle":"[714]买卖股票的最佳时机含手续费","frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"formTitle":"[715]Range 模块","frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","title":"Range 模块","titleSlug":"range-module"},{"formTitle":"[716]最大栈","frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"lock","title":"最大栈","titleSlug":"max-stack"},{"formTitle":"[717]1比特与2比特字符","frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"formTitle":"[718]最长重复子数组","frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"formTitle":"[719]找出第 k 小的距离对","frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"formTitle":"[720]词典中最长的单词","frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"formTitle":"[721]账户合并","frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","title":"账户合并","titleSlug":"accounts-merge"},{"formTitle":"[722]删除注释","frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","title":"删除注释","titleSlug":"remove-comments"},{"formTitle":"[723]粉碎糖果","frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"lock","title":"粉碎糖果","titleSlug":"candy-crush"},{"formTitle":"[724]寻找数组的中心索引","frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","title":"寻找数组的中心索引","titleSlug":"find-pivot-index"},{"formTitle":"[725]分隔链表","frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"","title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"formTitle":"[726]原子的数量","frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"","title":"原子的数量","titleSlug":"number-of-atoms"},{"formTitle":"[727]最小窗口子序列","frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"lock","title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"formTitle":"[728]自除数","frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","title":"自除数","titleSlug":"self-dividing-numbers"},{"formTitle":"[729]我的日程安排表 I","frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"formTitle":"[730]统计不同回文子字符串","frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","title":"统计不同回文子字符串","titleSlug":"count-different-palindromic-subsequences"},{"formTitle":"[731]我的日程安排表 II","frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"formTitle":"[732]我的日程安排表 III","frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"formTitle":"[733]图像渲染","frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"","title":"图像渲染","titleSlug":"flood-fill"},{"formTitle":"[734]句子相似性","frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"lock","title":"句子相似性","titleSlug":"sentence-similarity"},{"formTitle":"[735]行星碰撞","frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"","title":"行星碰撞","titleSlug":"asteroid-collision"},{"formTitle":"[736]Lisp 语法解析","frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"formTitle":"[737]句子相似性 II","frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"lock","title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"formTitle":"[738]单调递增的数字","frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"","title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"formTitle":"[739]每日温度","frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"","title":"每日温度","titleSlug":"daily-temperatures"},{"formTitle":"[740]删除与获得点数","frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","title":"删除与获得点数","titleSlug":"delete-and-earn"},{"formTitle":"[741]摘樱桃","frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","title":"摘樱桃","titleSlug":"cherry-pickup"},{"formTitle":"[742]二叉树最近的叶节点","frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"lock","title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"formTitle":"[743]网络延迟时间","frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"","title":"网络延迟时间","titleSlug":"network-delay-time"},{"formTitle":"[744]寻找比目标字母大的最小字母","frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"formTitle":"[745]前缀和后缀搜索","frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"formTitle":"[746]使用最小花费爬楼梯","frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"formTitle":"[747]至少是其他数字两倍的最大数","frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"formTitle":"[748]最短完整词","frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","title":"最短完整词","titleSlug":"shortest-completing-word"},{"formTitle":"[749]隔离病毒","frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","title":"隔离病毒","titleSlug":"contain-virus"},{"formTitle":"[750]角矩形的数量","frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"lock","title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"formTitle":"[751]IP 到 CIDR","frontendQuestionId":"751","leaf":true,"level":1,"nodeType":"def","questionId":"752","status":"lock","title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"formTitle":"[752]打开转盘锁","frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"","title":"打开转盘锁","titleSlug":"open-the-lock"},{"formTitle":"[753]破解保险箱","frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","title":"破解保险箱","titleSlug":"cracking-the-safe"},{"formTitle":"[754]到达终点数字","frontendQuestionId":"754","leaf":true,"level":1,"nodeType":"def","questionId":"755","status":"","title":"到达终点数字","titleSlug":"reach-a-number"},{"formTitle":"[755]倒水","frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"lock","title":"倒水","titleSlug":"pour-water"},{"formTitle":"[756]金字塔转换矩阵","frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"formTitle":"[757] 设置交集大小至少为2","frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","title":" 设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"formTitle":"[758]字符串中的加粗单词","frontendQuestionId":"758","leaf":true,"level":1,"nodeType":"def","questionId":"760","status":"lock","title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"formTitle":"[759]员工空闲时间","frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"lock","title":"员工空闲时间","titleSlug":"employee-free-time"},{"formTitle":"[760]找出变位映射","frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"lock","title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"formTitle":"[761]特殊的二进制序列","frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"formTitle":"[762]二进制表示中质数个计算置位","frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"formTitle":"[763]划分字母区间","frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","title":"划分字母区间","titleSlug":"partition-labels"},{"formTitle":"[764]最大加号标志","frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","title":"最大加号标志","titleSlug":"largest-plus-sign"},{"formTitle":"[765]情侣牵手","frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","title":"情侣牵手","titleSlug":"couples-holding-hands"},{"formTitle":"[766]托普利茨矩阵","frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"formTitle":"[767]重构字符串","frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","title":"重构字符串","titleSlug":"reorganize-string"},{"formTitle":"[768]最多能完成排序的块 II","frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"formTitle":"[769]最多能完成排序的块","frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"formTitle":"[770]基本计算器 IV","frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"formTitle":"[771]宝石与石头","frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"","title":"宝石与石头","titleSlug":"jewels-and-stones"},{"formTitle":"[772]基本计算器 III","frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"lock","title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"formTitle":"[773]滑动谜题","frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","title":"滑动谜题","titleSlug":"sliding-puzzle"},{"formTitle":"[774]最小化去加油站的最大距离","frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"lock","title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"formTitle":"[775]全局倒置与局部倒置","frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"formTitle":"[776]拆分二叉搜索树","frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"lock","title":"拆分二叉搜索树","titleSlug":"split-bst"},{"formTitle":"[777]在LR字符串中交换相邻字符","frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"formTitle":"[778]水位上升的泳池中游泳","frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"formTitle":"[779]第K个语法符号","frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"formTitle":"[780]到达终点","frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","title":"到达终点","titleSlug":"reaching-points"},{"formTitle":"[781]森林中的兔子","frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"formTitle":"[782]变为棋盘","frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"formTitle":"[783]二叉搜索树结点最小距离","frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"","title":"二叉搜索树结点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"formTitle":"[784]字母大小写全排列","frontendQuestionId":"784","leaf":true,"level":1,"nodeType":"def","questionId":"800","status":"","title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"formTitle":"[785]判断二分图","frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"","title":"判断二分图","titleSlug":"is-graph-bipartite"},{"formTitle":"[786]第 K 个最小的素数分数","frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"formTitle":"[787]K 站中转内最便宜的航班","frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"","title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"formTitle":"[788]旋转数字","frontendQuestionId":"788","leaf":true,"level":1,"nodeType":"def","questionId":"804","status":"","title":"旋转数字","titleSlug":"rotated-digits"},{"formTitle":"[789]逃脱阻碍者","frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"","title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"formTitle":"[790]多米诺和托米诺平铺","frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"formTitle":"[791]自定义字符串排序","frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"formTitle":"[792]匹配子序列的单词数","frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"formTitle":"[793]阶乘函数后K个零","frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","title":"阶乘函数后K个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"formTitle":"[794]有效的井字游戏","frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"formTitle":"[795]区间子数组个数","frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"formTitle":"[796]旋转字符串","frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","title":"旋转字符串","titleSlug":"rotate-string"},{"formTitle":"[797]所有可能的路径","frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"","title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"formTitle":"[798]得分最高的最小轮调","frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"formTitle":"[799]香槟塔","frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","title":"香槟塔","titleSlug":"champagne-tower"},{"formTitle":"[800]相似 RGB 颜色","frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"lock","title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"formTitle":"[801]使序列递增的最小交换次数","frontendQuestionId":"801","leaf":true,"level":2,"nodeType":"def","questionId":"819","status":"","title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"formTitle":"[802]找到最终的安全状态","frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"","title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"formTitle":"[803]打砖块","frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"formTitle":"[804]唯一摩尔斯密码词","frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"formTitle":"[805]数组的均值分割","frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"formTitle":"[806]写字符串需要的行数","frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"formTitle":"[807]保持城市天际线","frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"formTitle":"[808]分汤","frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","title":"分汤","titleSlug":"soup-servings"},{"formTitle":"[809]情感丰富的文字","frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","title":"情感丰富的文字","titleSlug":"expressive-words"},{"formTitle":"[810]黑板异或游戏","frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"","title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"formTitle":"[811]子域名访问计数","frontendQuestionId":"811","leaf":true,"level":1,"nodeType":"def","questionId":"829","status":"","title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"formTitle":"[812]最大三角形面积","frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"formTitle":"[813]最大平均值和的分组","frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"formTitle":"[814]二叉树剪枝","frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"formTitle":"[815]公交路线","frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"","title":"公交路线","titleSlug":"bus-routes"},{"formTitle":"[816]模糊坐标","frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"formTitle":"[817]链表组件","frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"","title":"链表组件","titleSlug":"linked-list-components"},{"formTitle":"[818]赛车","frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","title":"赛车","titleSlug":"race-car"},{"formTitle":"[819]最常见的单词","frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","title":"最常见的单词","titleSlug":"most-common-word"},{"formTitle":"[820]单词的压缩编码","frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"formTitle":"[821]字符的最短距离","frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"formTitle":"[822]翻转卡片游戏","frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"formTitle":"[823]带因子的二叉树","frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"formTitle":"[824]山羊拉丁文","frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","title":"山羊拉丁文","titleSlug":"goat-latin"},{"formTitle":"[825]适龄的朋友","frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"formTitle":"[826]安排工作以达到最大收益","frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"formTitle":"[827]最大人工岛","frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","title":"最大人工岛","titleSlug":"making-a-large-island"},{"formTitle":"[828]独特字符串","frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","title":"独特字符串","titleSlug":"unique-letter-string"},{"formTitle":"[829]连续整数求和","frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"formTitle":"[830]较大分组的位置","frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"formTitle":"[831]隐藏个人信息","frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"formTitle":"[832]翻转图像","frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","title":"翻转图像","titleSlug":"flipping-an-image"},{"formTitle":"[833]字符串中的查找与替换","frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"formTitle":"[834]树中距离之和","frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"formTitle":"[835]图像重叠","frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","title":"图像重叠","titleSlug":"image-overlap"},{"formTitle":"[836]矩形重叠","frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","title":"矩形重叠","titleSlug":"rectangle-overlap"},{"formTitle":"[837]新21点","frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","title":"新21点","titleSlug":"new-21-game"},{"formTitle":"[838]推多米诺","frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","title":"推多米诺","titleSlug":"push-dominoes"},{"formTitle":"[839]相似字符串组","frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","title":"相似字符串组","titleSlug":"similar-string-groups"},{"formTitle":"[840]矩阵中的幻方","frontendQuestionId":"840","leaf":true,"level":1,"nodeType":"def","questionId":"870","status":"","title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"formTitle":"[841]钥匙和房间","frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"","title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"formTitle":"[842]将数组拆分成斐波那契序列","frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"formTitle":"[843]猜猜这个单词","frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","title":"猜猜这个单词","titleSlug":"guess-the-word"},{"formTitle":"[844]比较含退格的字符串","frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"","title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"formTitle":"[845]数组中的最长山脉","frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"formTitle":"[846]一手顺子","frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","title":"一手顺子","titleSlug":"hand-of-straights"},{"formTitle":"[847]访问所有节点的最短路径","frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"","title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"formTitle":"[848]字母移位","frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","title":"字母移位","titleSlug":"shifting-letters"},{"formTitle":"[849]到最近的人的最大距离","frontendQuestionId":"849","leaf":true,"level":1,"nodeType":"def","questionId":"879","status":"","title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"formTitle":"[850]矩形面积 II","frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"formTitle":"[851]喧闹和富有","frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","title":"喧闹和富有","titleSlug":"loud-and-rich"},{"formTitle":"[852]山脉数组的峰顶索引","frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"","title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"formTitle":"[853]车队","frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","title":"车队","titleSlug":"car-fleet"},{"formTitle":"[854]相似度为 K 的字符串","frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"formTitle":"[855]考场就座","frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","title":"考场就座","titleSlug":"exam-room"},{"formTitle":"[856]括号的分数","frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"","title":"括号的分数","titleSlug":"score-of-parentheses"},{"formTitle":"[857]雇佣 K 名工人的最低成本","frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"formTitle":"[858]镜面反射","frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","title":"镜面反射","titleSlug":"mirror-reflection"},{"formTitle":"[859]亲密字符串","frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","title":"亲密字符串","titleSlug":"buddy-strings"},{"formTitle":"[860]柠檬水找零","frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"","title":"柠檬水找零","titleSlug":"lemonade-change"},{"formTitle":"[861]翻转矩阵后的得分","frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"","title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"formTitle":"[862]和至少为 K 的最短子数组","frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"formTitle":"[863]二叉树中所有距离为 K 的结点","frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"","title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"formTitle":"[864]获取所有钥匙的最短路径","frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"formTitle":"[865]具有所有最深结点的最小子树","frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","title":"具有所有最深结点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"formTitle":"[866]回文素数","frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","title":"回文素数","titleSlug":"prime-palindrome"},{"formTitle":"[867]转置矩阵","frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","title":"转置矩阵","titleSlug":"transpose-matrix"},{"formTitle":"[868]二进制间距","frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","title":"二进制间距","titleSlug":"binary-gap"},{"formTitle":"[869]重新排序得到 2 的幂","frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"formTitle":"[870]优势洗牌","frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"","title":"优势洗牌","titleSlug":"advantage-shuffle"},{"formTitle":"[871]最低加油次数","frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"formTitle":"[872]叶子相似的树","frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"","title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"formTitle":"[873]最长的斐波那契子序列的长度","frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"formTitle":"[874]模拟行走机器人","frontendQuestionId":"874","leaf":true,"level":1,"nodeType":"def","questionId":"906","status":"","title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"formTitle":"[875]爱吃香蕉的珂珂","frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"formTitle":"[876]链表的中间结点","frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"","title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"formTitle":"[877]石子游戏","frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"","title":"石子游戏","titleSlug":"stone-game"},{"formTitle":"[878]第 N 个神奇数字","frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"formTitle":"[879]盈利计划","frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"","title":"盈利计划","titleSlug":"profitable-schemes"},{"formTitle":"[880]索引处的解码字符串","frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"","title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"formTitle":"[881]救生艇","frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"","title":"救生艇","titleSlug":"boats-to-save-people"},{"formTitle":"[882]细分图中的可到达结点","frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"formTitle":"[883]三维形体投影面积","frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"formTitle":"[884]两句话中的不常见单词","frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"formTitle":"[885]螺旋矩阵 III","frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"formTitle":"[886]可能的二分法","frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","title":"可能的二分法","titleSlug":"possible-bipartition"},{"formTitle":"[887]鸡蛋掉落","frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"formTitle":"[888]公平的糖果交换","frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","title":"公平的糖果交换","titleSlug":"fair-candy-swap"},{"formTitle":"[889]根据前序和后序遍历构造二叉树","frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"formTitle":"[890]查找和替换模式","frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"formTitle":"[891]子序列宽度之和","frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"formTitle":"[892]三维形体的表面积","frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"formTitle":"[893]特殊等价字符串组","frontendQuestionId":"893","leaf":true,"level":1,"nodeType":"def","questionId":"929","status":"","title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"formTitle":"[894]所有可能的满二叉树","frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"formTitle":"[895]最大频率栈","frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"formTitle":"[896]单调数列","frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","title":"单调数列","titleSlug":"monotonic-array"},{"formTitle":"[897]递增顺序查找树","frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"","title":"递增顺序查找树","titleSlug":"increasing-order-search-tree"},{"formTitle":"[898]子数组按位或操作","frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"formTitle":"[899]有序队列","frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","title":"有序队列","titleSlug":"orderly-queue"},{"formTitle":"[900]RLE 迭代器","frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","title":"RLE 迭代器","titleSlug":"rle-iterator"},{"formTitle":"[901]股票价格跨度","frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"","title":"股票价格跨度","titleSlug":"online-stock-span"},{"formTitle":"[902]最大为 N 的数字组合","frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"formTitle":"[903]DI 序列的有效排列","frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"formTitle":"[904]水果成篮","frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","title":"水果成篮","titleSlug":"fruit-into-baskets"},{"formTitle":"[905]按奇偶排序数组","frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"formTitle":"[906]超级回文数","frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","title":"超级回文数","titleSlug":"super-palindromes"},{"formTitle":"[907]子数组的最小值之和","frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"","title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"formTitle":"[908]最小差值 I","frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","title":"最小差值 I","titleSlug":"smallest-range-i"},{"formTitle":"[909]蛇梯棋","frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"","title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"formTitle":"[910]最小差值 II","frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","title":"最小差值 II","titleSlug":"smallest-range-ii"},{"formTitle":"[911]在线选举","frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","title":"在线选举","titleSlug":"online-election"},{"formTitle":"[912]排序数组","frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"","title":"排序数组","titleSlug":"sort-an-array"},{"formTitle":"[913]猫和老鼠","frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"formTitle":"[914]卡牌分组","frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"","title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"formTitle":"[915]分割数组","frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"formTitle":"[916]单词子集","frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","title":"单词子集","titleSlug":"word-subsets"},{"formTitle":"[917]仅仅反转字母","frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"formTitle":"[918]环形子数组的最大和","frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"formTitle":"[919]完全二叉树插入器","frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"formTitle":"[920]播放列表的数量","frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"formTitle":"[921]使括号有效的最少添加","frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"","title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"formTitle":"[922]按奇偶排序数组 II","frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"","title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"formTitle":"[923]三数之和的多种可能","frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"formTitle":"[924]尽量减少恶意软件的传播","frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"formTitle":"[925]长按键入","frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","title":"长按键入","titleSlug":"long-pressed-name"},{"formTitle":"[926]将字符串翻转到单调递增","frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"formTitle":"[927]三等分","frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","title":"三等分","titleSlug":"three-equal-parts"},{"formTitle":"[928]尽量减少恶意软件的传播 II","frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"formTitle":"[929]独特的电子邮件地址","frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"formTitle":"[930]和相同的二元子数组","frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"","title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"formTitle":"[931]下降路径最小和","frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"formTitle":"[932]漂亮数组","frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","title":"漂亮数组","titleSlug":"beautiful-array"},{"formTitle":"[933]最近的请求次数","frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"formTitle":"[934]最短的桥","frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","title":"最短的桥","titleSlug":"shortest-bridge"},{"formTitle":"[935]骑士拨号器","frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","title":"骑士拨号器","titleSlug":"knight-dialer"},{"formTitle":"[936]戳印序列","frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","title":"戳印序列","titleSlug":"stamping-the-sequence"},{"formTitle":"[937]重新排列日志文件","frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"formTitle":"[938]二叉搜索树的范围和","frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"","title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"formTitle":"[939]最小面积矩形","frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"formTitle":"[940]不同的子序列 II","frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"","title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"formTitle":"[941]有效的山脉数组","frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"formTitle":"[942]增减字符串匹配","frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","title":"增减字符串匹配","titleSlug":"di-string-match"},{"formTitle":"[943]最短超级串","frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"formTitle":"[944]删列造序","frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"formTitle":"[945]使数组唯一的最小增量","frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"formTitle":"[946]验证栈序列","frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"","title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"formTitle":"[947]移除最多的同行或同列石头","frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"formTitle":"[948]令牌放置","frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","title":"令牌放置","titleSlug":"bag-of-tokens"},{"formTitle":"[949]给定数字能组成的最大时间","frontendQuestionId":"949","leaf":true,"level":1,"nodeType":"def","questionId":"986","status":"","title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"formTitle":"[950]按递增顺序显示卡牌","frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"formTitle":"[951]翻转等价二叉树","frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"formTitle":"[952]按公因数计算最大组件大小","frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"formTitle":"[953]验证外星语词典","frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"formTitle":"[954]二倍数对数组","frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"formTitle":"[955]删列造序 II","frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"formTitle":"[956]最高的广告牌","frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","title":"最高的广告牌","titleSlug":"tallest-billboard"},{"formTitle":"[957]N 天后的牢房","frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"formTitle":"[958]二叉树的完全性检验","frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"formTitle":"[959]由斜杠划分区域","frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"formTitle":"[960]删列造序 III","frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"formTitle":"[961]重复 N 次的元素","frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"formTitle":"[962]最大宽度坡","frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"formTitle":"[963]最小面积矩形 II","frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"formTitle":"[964]表示数字的最少运算符","frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"formTitle":"[965]单值二叉树","frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"formTitle":"[966]元音拼写检查器","frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"formTitle":"[967]连续差相同的数字","frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"formTitle":"[968]监控二叉树","frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"formTitle":"[969]煎饼排序","frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","title":"煎饼排序","titleSlug":"pancake-sorting"},{"formTitle":"[970]强整数","frontendQuestionId":"970","leaf":true,"level":1,"nodeType":"def","questionId":"1010","status":"","title":"强整数","titleSlug":"powerful-integers"},{"formTitle":"[971]翻转二叉树以匹配先序遍历","frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"formTitle":"[972]相等的有理数","frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"formTitle":"[973]最接近原点的 K 个点","frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"","title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"formTitle":"[974]和可被 K 整除的子数组","frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"formTitle":"[975]奇偶跳","frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","title":"奇偶跳","titleSlug":"odd-even-jump"},{"formTitle":"[976]三角形的最大周长","frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"","title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"formTitle":"[977]有序数组的平方","frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"","title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"formTitle":"[978]最长湍流子数组","frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"formTitle":"[979]在二叉树中分配硬币","frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"formTitle":"[980]不同路径 III","frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","title":"不同路径 III","titleSlug":"unique-paths-iii"},{"formTitle":"[981]基于时间的键值存储","frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"","title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"formTitle":"[982]按位与为零的三元组","frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"formTitle":"[983]最低票价","frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"formTitle":"[984]不含 AAA 或 BBB 的字符串","frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"formTitle":"[985]查询后的偶数和","frontendQuestionId":"985","leaf":true,"level":1,"nodeType":"def","questionId":"1027","status":"","title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"formTitle":"[986]区间列表的交集","frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"","title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"formTitle":"[987]二叉树的垂序遍历","frontendQuestionId":"987","leaf":true,"level":2,"nodeType":"def","questionId":"1029","status":"","title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"formTitle":"[988]从叶结点开始的最小字符串","frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"formTitle":"[989]数组形式的整数加法","frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"formTitle":"[990]等式方程的可满足性","frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"formTitle":"[991]坏了的计算器","frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","title":"坏了的计算器","titleSlug":"broken-calculator"},{"formTitle":"[992]K 个不同整数的子数组","frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"formTitle":"[993]二叉树的堂兄弟节点","frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"","title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"formTitle":"[994]腐烂的橘子","frontendQuestionId":"994","leaf":true,"level":1,"nodeType":"def","questionId":"1036","status":"","title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"formTitle":"[995]K 连续位的最小翻转次数","frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"formTitle":"[996]正方形数组的数目","frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"formTitle":"[997]找到小镇的法官","frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"formTitle":"[998]最大二叉树 II","frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"formTitle":"[999]车的可用捕获量","frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","title":"车的可用捕获量","titleSlug":"available-captures-for-rook"},{"formTitle":"[1000]合并石头的最低成本","frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"formTitle":"[1001]网格照明","frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","title":"网格照明","titleSlug":"grid-illumination"},{"formTitle":"[1002]查找常用字符","frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","title":"查找常用字符","titleSlug":"find-common-characters"},{"formTitle":"[1003]检查替换后的词是否有效","frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"","title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"formTitle":"[1004]最大连续1的个数 III","frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"","title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"formTitle":"[1005]K 次取反后最大化的数组和","frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"formTitle":"[1006]笨阶乘","frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"","title":"笨阶乘","titleSlug":"clumsy-factorial"},{"formTitle":"[1007]行相等的最少多米诺旋转","frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"formTitle":"[1008]先序遍历构造二叉树","frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","title":"先序遍历构造二叉树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"formTitle":"[1009]十进制整数的反码","frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frontendQuestionId":"1010","leaf":true,"level":1,"nodeType":"def","questionId":"1055","status":"","title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"formTitle":"[1011]在 D 天内送达包裹的能力","frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"","title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"formTitle":"[1012]至少有 1 位重复的数字","frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"formTitle":"[1013]将数组分成和相等的三个部分","frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"formTitle":"[1014]最佳观光组合","frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"formTitle":"[1015]可被 K 整除的最小整数","frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"formTitle":"[1017]负二进制转换","frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","title":"负二进制转换","titleSlug":"convert-to-base-2"},{"formTitle":"[1018]可被 5 整除的二进制前缀","frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"formTitle":"[1019]链表中的下一个更大节点","frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"","title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"formTitle":"[1020]飞地的数量","frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","title":"飞地的数量","titleSlug":"number-of-enclaves"},{"formTitle":"[1021]删除最外层的括号","frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"","title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"formTitle":"[1022]从根到叶的二进制数之和","frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"formTitle":"[1023]驼峰式匹配","frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"formTitle":"[1024]视频拼接","frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","title":"视频拼接","titleSlug":"video-stitching"},{"formTitle":"[1025]除数博弈","frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","title":"除数博弈","titleSlug":"divisor-game"},{"formTitle":"[1026]节点与其祖先之间的最大差值","frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"formTitle":"[1027]最长等差数列","frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"","title":"最长等差数列","titleSlug":"longest-arithmetic-sequence"},{"formTitle":"[1028]从先序遍历还原二叉树","frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"formTitle":"[1029]两地调度","frontendQuestionId":"1029","leaf":true,"level":1,"nodeType":"def","questionId":"1095","status":"","title":"两地调度","titleSlug":"two-city-scheduling"},{"formTitle":"[1030]距离顺序排列矩阵单元格","frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"formTitle":"[1031]两个非重叠子数组的最大和","frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"formTitle":"[1032]字符流","frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","title":"字符流","titleSlug":"stream-of-characters"},{"formTitle":"[1033]移动石子直到连续","frontendQuestionId":"1033","leaf":true,"level":1,"nodeType":"def","questionId":"1103","status":"","title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"formTitle":"[1034]边框着色","frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","title":"边框着色","titleSlug":"coloring-a-border"},{"formTitle":"[1035]不相交的线","frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"","title":"不相交的线","titleSlug":"uncrossed-lines"},{"formTitle":"[1036]逃离大迷宫","frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"formTitle":"[1037]有效的回旋镖","frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"formTitle":"[1038]从二叉搜索树到更大和树","frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","title":"从二叉搜索树到更大和树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"formTitle":"[1039]多边形三角剖分的最低得分","frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"formTitle":"[1040]移动石子直到连续 II","frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"formTitle":"[1041]困于环中的机器人","frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"formTitle":"[1042]不邻接植花","frontendQuestionId":"1042","leaf":true,"level":1,"nodeType":"def","questionId":"1120","status":"","title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"formTitle":"[1043]分隔数组以得到最大和","frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"formTitle":"[1044]最长重复子串","frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"formTitle":"[1045]买下所有产品的客户","frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"lock","title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"formTitle":"[1046]最后一块石头的重量","frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"formTitle":"[1047]删除字符串中的所有相邻重复项","frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"","title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"formTitle":"[1048]最长字符串链","frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","title":"最长字符串链","titleSlug":"longest-string-chain"},{"formTitle":"[1049]最后一块石头的重量 II","frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"","title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"formTitle":"[1050]合作过至少三次的演员和导演","frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"lock","title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"formTitle":"[1051]高度检查器","frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","title":"高度检查器","titleSlug":"height-checker"},{"formTitle":"[1052]爱生气的书店老板","frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"formTitle":"[1053]交换一次的先前排列","frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"formTitle":"[1054]距离相等的条形码","frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"formTitle":"[1055]形成字符串的最短路径","frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"lock","title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"formTitle":"[1056]易混淆数","frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"lock","title":"易混淆数","titleSlug":"confusing-number"},{"formTitle":"[1057]校园自行车分配","frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"lock","title":"校园自行车分配","titleSlug":"campus-bikes"},{"formTitle":"[1058]最小化舍入误差以满足目标","frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"lock","title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"formTitle":"[1059]从始点到终点的所有路径","frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"lock","title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"formTitle":"[1060]有序数组中的缺失元素","frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"lock","title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"formTitle":"[1061]按字典序排列最小的等效字符串","frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"lock","title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"formTitle":"[1062]最长重复子串","frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"lock","title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"formTitle":"[1063]有效子数组的数目","frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"lock","title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"formTitle":"[1064]不动点","frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"lock","title":"不动点","titleSlug":"fixed-point"},{"formTitle":"[1065]字符串的索引对","frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"lock","title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"formTitle":"[1066]校园自行车分配 II","frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"lock","title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"formTitle":"[1067]范围内的数字计数","frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"lock","title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"formTitle":"[1068]产品销售分析 I","frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"lock","title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"formTitle":"[1069]产品销售分析 II","frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"lock","title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"formTitle":"[1070]产品销售分析 III","frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"lock","title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"formTitle":"[1071]字符串的最大公因子","frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"","title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"formTitle":"[1072]按列翻转得到最大值等行数","frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"formTitle":"[1073]负二进制数相加","frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"formTitle":"[1074]元素和为目标值的子矩阵数量","frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"","title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"formTitle":"[1075]项目员工 I","frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"lock","title":"项目员工 I","titleSlug":"project-employees-i"},{"formTitle":"[1076]项目员工II","frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"lock","title":"项目员工II","titleSlug":"project-employees-ii"},{"formTitle":"[1077]项目员工 III","frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"lock","title":"项目员工 III","titleSlug":"project-employees-iii"},{"formTitle":"[1078]Bigram 分词","frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"formTitle":"[1079]活字印刷","frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"formTitle":"[1080]根到叶路径上的不足节点","frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"formTitle":"[1081]不同字符的最小子序列","frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"","title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"formTitle":"[1082]销售分析 I ","frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"lock","title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"formTitle":"[1083]销售分析 II","frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"lock","title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"formTitle":"[1084]销售分析III","frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"lock","title":"销售分析III","titleSlug":"sales-analysis-iii"},{"formTitle":"[1085]最小元素各数位之和","frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"lock","title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"formTitle":"[1086]前五科的均分","frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"lock","title":"前五科的均分","titleSlug":"high-five"},{"formTitle":"[1087]字母切换","frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"lock","title":"字母切换","titleSlug":"brace-expansion"},{"formTitle":"[1088]易混淆数 II","frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"lock","title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"formTitle":"[1089]复写零","frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","title":"复写零","titleSlug":"duplicate-zeros"},{"formTitle":"[1090]受标签影响的最大值","frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"formTitle":"[1091]二进制矩阵中的最短路径","frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"","title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"formTitle":"[1092]最短公共超序列","frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"formTitle":"[1093]大样本统计","frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"formTitle":"[1094]拼车","frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","title":"拼车","titleSlug":"car-pooling"},{"formTitle":"[1095]山脉数组中查找目标值","frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"formTitle":"[1096]花括号展开 II","frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"formTitle":"[1097]游戏玩法分析 V","frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"lock","title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"formTitle":"[1098]小众书籍","frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"lock","title":"小众书籍","titleSlug":"unpopular-books"},{"formTitle":"[1099]小于 K 的两数之和","frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"lock","title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"formTitle":"[1100]长度为 K 的无重复字符子串","frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"lock","title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"formTitle":"[1101]彼此熟识的最早时间","frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"lock","title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"formTitle":"[1102]得分最高的路径","frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"lock","title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"formTitle":"[1103]分糖果 II","frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"formTitle":"[1104]二叉树寻路","frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"","title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"formTitle":"[1105]填充书架","frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"formTitle":"[1106]解析布尔表达式","frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"formTitle":"[1107]每日新用户统计","frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"lock","title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"formTitle":"[1108]IP 地址无效化","frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"formTitle":"[1109]航班预订统计","frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"","title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"formTitle":"[1110]删点成林","frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"formTitle":"[1111]有效括号的嵌套深度","frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"formTitle":"[1112]Highest Grade For Each Student","frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"lock","title":"Highest Grade For Each Student","titleSlug":"highest-grade-for-each-student"},{"formTitle":"[1113]Reported Posts","frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"lock","title":"Reported Posts","titleSlug":"reported-posts"},{"formTitle":"[1114]按序打印","frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","title":"按序打印","titleSlug":"print-in-order"},{"formTitle":"[1115]交替打印FooBar","frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"formTitle":"[1116]打印零与奇偶数","frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"formTitle":"[1117]H2O 生成","frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","title":"H2O 生成","titleSlug":"building-h2o"},{"formTitle":"[1118]一月有多少天","frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"lock","title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"formTitle":"[1119]删去字符串中的元音","frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"lock","title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"formTitle":"[1120]子树的最大平均值","frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"lock","title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"formTitle":"[1121]将数组分成几个递增序列","frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"lock","title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"formTitle":"[1122]数组的相对排序","frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","title":"数组的相对排序","titleSlug":"relative-sort-array"},{"formTitle":"[1123]最深叶节点的最近公共祖先","frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"formTitle":"[1124]表现良好的最长时间段","frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"","title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"formTitle":"[1125]最小的必要团队","frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"formTitle":"[1126]Active Businesses","frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"lock","title":"Active Businesses","titleSlug":"active-businesses"},{"formTitle":"[1127]User Purchase Platform","frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"lock","title":"User Purchase Platform","titleSlug":"user-purchase-platform"},{"formTitle":"[1128]等价多米诺骨牌对的数量","frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"formTitle":"[1129]颜色交替的最短路径","frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"formTitle":"[1130]叶值的最小代价生成树","frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"","title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"formTitle":"[1131]绝对值表达式的最大值","frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"formTitle":"[1132]Reported Posts II","frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"lock","title":"Reported Posts II","titleSlug":"reported-posts-ii"},{"formTitle":"[1133]最大唯一数","frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"lock","title":"最大唯一数","titleSlug":"largest-unique-number"},{"formTitle":"[1134]阿姆斯特朗数","frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"lock","title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"formTitle":"[1135]最低成本联通所有城市","frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"lock","title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"formTitle":"[1136]平行课程","frontendQuestionId":"1136","leaf":true,"level":3,"nodeType":"def","questionId":"1101","status":"lock","title":"平行课程","titleSlug":"parallel-courses"},{"formTitle":"[1137]第 N 个泰波那契数","frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"","title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"formTitle":"[1138]字母板上的路径","frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"formTitle":"[1139]最大的以 1 为边界的正方形","frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"formTitle":"[1140]石子游戏 II","frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","title":"石子游戏 II","titleSlug":"stone-game-ii"},{"formTitle":"[1141]User Activity for the Past 30 Days I","frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"lock","title":"User Activity for the Past 30 Days I","titleSlug":"user-activity-for-the-past-30-days-i"},{"formTitle":"[1142]User Activity for the Past 30 Days II","frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"lock","title":"User Activity for the Past 30 Days II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"formTitle":"[1143]最长公共子序列","frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"","title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"formTitle":"[1144]递减元素使数组呈锯齿状","frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"","title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"formTitle":"[1145]二叉树着色游戏","frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"formTitle":"[1146]快照数组","frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","title":"快照数组","titleSlug":"snapshot-array"},{"formTitle":"[1147]段式回文","frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"formTitle":"[1148]Article Views I","frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"lock","title":"Article Views I","titleSlug":"article-views-i"},{"formTitle":"[1149]Article Views II","frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"lock","title":"Article Views II","titleSlug":"article-views-ii"},{"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"lock","title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"formTitle":"[1151]最少交换次数来组合所有的 1","frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"lock","title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"formTitle":"[1152]用户网站访问行为分析","frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"lock","title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"formTitle":"[1153]字符串转化","frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"lock","title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"formTitle":"[1154]一年中的第几天","frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","title":"一年中的第几天","titleSlug":"day-of-the-year"},{"formTitle":"[1155]掷骰子的N种方法","frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"formTitle":"[1156]单字符重复子串的最大长度","frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"formTitle":"[1157]子数组中占绝大多数的元素","frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"formTitle":"[1158]Market Analysis I","frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"lock","title":"Market Analysis I","titleSlug":"market-analysis-i"},{"formTitle":"[1159]Market Analysis II","frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"lock","title":"Market Analysis II","titleSlug":"market-analysis-ii"},{"formTitle":"[1160]拼写单词","frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"formTitle":"[1161]最大层内元素和","frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"formTitle":"[1162]地图分析","frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"formTitle":"[1163]按字典序排在最后的子串","frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"formTitle":"[1164]Product Price at a Given Date","frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"lock","title":"Product Price at a Given Date","titleSlug":"product-price-at-a-given-date"},{"formTitle":"[1165]单行键盘","frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"lock","title":"单行键盘","titleSlug":"single-row-keyboard"},{"formTitle":"[1166]设计文件系统","frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"lock","title":"设计文件系统","titleSlug":"design-file-system"},{"formTitle":"[1167]连接棒材的最低费用","frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"lock","title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"formTitle":"[1168]水资源分配优化","frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"lock","title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"formTitle":"[1169]查询无效交易","frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","title":"查询无效交易","titleSlug":"invalid-transactions"},{"formTitle":"[1170]比较字符串最小字母出现频次","frontendQuestionId":"1170","leaf":true,"level":1,"nodeType":"def","questionId":"1273","status":"","title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"formTitle":"[1171]从链表中删去总和值为零的连续节点","frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"","title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"formTitle":"[1172]餐盘栈","frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"formTitle":"[1173]Immediate Food Delivery I","frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"lock","title":"Immediate Food Delivery I","titleSlug":"immediate-food-delivery-i"},{"formTitle":"[1174]Immediate Food Delivery II","frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"lock","title":"Immediate Food Delivery II","titleSlug":"immediate-food-delivery-ii"},{"formTitle":"[1175]质数排列","frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","title":"质数排列","titleSlug":"prime-arrangements"},{"formTitle":"[1176]健身计划评估","frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"lock","title":"健身计划评估","titleSlug":"diet-plan-performance"},{"formTitle":"[1177]构建回文串检测","frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"formTitle":"[1178]猜字谜","frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"formTitle":"[1179]重新格式化部门表","frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"formTitle":"[1180]统计只含单一字母的子串","frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"lock","title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"formTitle":"[1181]前后拼接","frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"lock","title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"formTitle":"[1182]与目标颜色间的最短距离","frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"lock","title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"formTitle":"[1183]矩阵中 1 的最大数量","frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"lock","title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"formTitle":"[1184]公交站间的距离","frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"formTitle":"[1185]一周中的第几天","frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","title":"一周中的第几天","titleSlug":"day-of-the-week"},{"formTitle":"[1186]删除一次得到子数组最大和","frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"formTitle":"[1187]使数组严格递增","frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"formTitle":"[1188]设计有限阻塞队列","frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"lock","title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"formTitle":"[1189]“气球” 的最大数量","frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"formTitle":"[1190]反转每对括号间的子串","frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"","title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"formTitle":"[1191]K 次串联后最大子数组之和","frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"formTitle":"[1192]查找集群内的「关键连接」","frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"formTitle":"[1193]每月交易 I","frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"lock","title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"formTitle":"[1194]锦标赛优胜者","frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"lock","title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"formTitle":"[1195]交替打印字符串","frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"formTitle":"[1196]最多可以买到的苹果数量","frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"lock","title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"formTitle":"[1197]进击的骑士","frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"lock","title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"formTitle":"[1198]找出所有行中最小公共元素","frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"lock","title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"formTitle":"[1199]建造街区的最短时间","frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"lock","title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"formTitle":"[1200]最小绝对差","frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"formTitle":"[1201]丑数 III","frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","title":"丑数 III","titleSlug":"ugly-number-iii"},{"formTitle":"[1202]交换字符串中的元素","frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"formTitle":"[1203]项目管理","frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"formTitle":"[1204]Last Person to Fit in the Elevator","frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"lock","title":"Last Person to Fit in the Elevator","titleSlug":"last-person-to-fit-in-the-elevator"},{"formTitle":"[1205]每月交易II","frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"lock","title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"formTitle":"[1206]设计跳表","frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","title":"设计跳表","titleSlug":"design-skiplist"},{"formTitle":"[1207]独一无二的出现次数","frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"formTitle":"[1208]尽可能使字符串相等","frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"","title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"formTitle":"[1210]穿过迷宫的最少移动次数","frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"formTitle":"[1211]Queries Quality and Percentage","frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"lock","title":"Queries Quality and Percentage","titleSlug":"queries-quality-and-percentage"},{"formTitle":"[1212]Team Scores in Football Tournament","frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"lock","title":"Team Scores in Football Tournament","titleSlug":"team-scores-in-football-tournament"},{"formTitle":"[1213]三个有序数组的交集","frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"lock","title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"formTitle":"[1214]查找两棵二叉搜索树之和","frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"lock","title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"formTitle":"[1215]步进数","frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"lock","title":"步进数","titleSlug":"stepping-numbers"},{"formTitle":"[1216]验证回文字符串 III","frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"lock","title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"formTitle":"[1217]玩筹码","frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"","title":"玩筹码","titleSlug":"play-with-chips"},{"formTitle":"[1218]最长定差子序列","frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"formTitle":"[1219]黄金矿工","frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"formTitle":"[1220]统计元音字母序列的数目","frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"formTitle":"[1221]分割平衡字符串","frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"","title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"formTitle":"[1222]可以攻击国王的皇后","frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"formTitle":"[1223]掷骰子模拟","frontendQuestionId":"1223","leaf":true,"level":2,"nodeType":"def","questionId":"1343","status":"","title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"formTitle":"[1224]最大相等频率","frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"formTitle":"[1225]Report Contiguous Dates","frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"","title":"Report Contiguous Dates","titleSlug":"report-contiguous-dates"},{"formTitle":"[1226]The Dining Philosophers","frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","title":"The Dining Philosophers","titleSlug":"the-dining-philosophers"},{"formTitle":"[1228]等差数列中缺失的数字","frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"lock","title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"formTitle":"[1229]安排会议日程","frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"lock","title":"安排会议日程","titleSlug":"meeting-scheduler"},{"formTitle":"[1230]抛掷硬币","frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"lock","title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"formTitle":"[1231]分享巧克力","frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"lock","title":"分享巧克力","titleSlug":"divide-chocolate"},{"formTitle":"[1232]缀点成线","frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"formTitle":"[1233]删除子文件夹","frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"formTitle":"[1234]替换子串得到平衡字符串","frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"formTitle":"[1235]规划兼职工作","frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"formTitle":"[1236]Web Crawler","frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"lock","title":"Web Crawler","titleSlug":"web-crawler"},{"formTitle":"[LCP 1]猜数字","frontendQuestionId":"LCP 1","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","title":"猜数字","titleSlug":"guess-numbers"},{"formTitle":"[LCP 2]分式化简","frontendQuestionId":"LCP 2","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","title":"分式化简","titleSlug":"deep-dark-fraction"},{"formTitle":"[LCP 3]机器人大冒险","frontendQuestionId":"LCP 3","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","title":"机器人大冒险","titleSlug":"programmable-robot"},{"formTitle":"[LCP 4]覆盖","frontendQuestionId":"LCP 4","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","title":"覆盖","titleSlug":"broken-board-dominoes"},{"formTitle":"[LCP 5]发 LeetCoin","frontendQuestionId":"LCP 5","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","title":"发 LeetCoin","titleSlug":"coin-bonus"}]