摘要：一、题意 A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties: The left subtree of a node contains only n
阅读全文
摘要：一、题意 Given an array of integers, return the maximum sum for a non-empty subarray (contiguous elements) with at most one element deletion. In other wor
阅读全文
摘要：一、题意 Given a string s, we make queries on substrings of s. For each query queries[i] = [left, right, k], we may rearrange the substring s[left], ...,
阅读全文
摘要：一、题意 A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties: The left subtree of a node contains only n
阅读全文
