摘要：
Description Given an array nums, we call (i, j) an important reverse pair if i < j and nums[i] > 2*nums[j]. You need to return the number of important 阅读全文
摘要：
Description You have k lists of sorted integers in ascending order. Find the smallest range that includes at least one number from each of the k lists 阅读全文