原题地址:https://leetcode.com/problems/reverse-pairs/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 reverse pairs in the given array.
Example1:
Input: [1,3,2,3,1]
Output: 2
Example2:
Input: [2,4,3,5,1]
Output: 3
Note:
1.The length of the given array will not exceed 50,000.
2.All the numbers in the input array are in the range of 32-bit integer.
题解:
思路是创建一个新的vector容器nums2, 将vector < int> nums里每个元素的两倍push进去(此处将元素类型转化为long)。遍历nums,并用二分查找lower_bound()找到nums[i]*2在nums2中的位置,将其删除,这样就可以将查找nums[i] > nums[j]*2中j的范围限制在当前元素的右边。每次都将当前元素在nums2中对应的元素删除,就可以达到在接下来的查找中只查找还未遍历的剩余元素。
查找nums[i] > nums[j]*2的对数实际上就是找到nums[i]在新容器nums2的位置。这里再次使用stl自带的二分查找lower_bound(),并用distance()函数求出其下标。然后加到一个累加变量上去。
代码:
class Solution {
public:
int reversePairs(vector<int>& nums) {
vector<long> nums2;
for (int i = 0; i < nums.size(); i++) nums2.push_back((long)nums[i] * 2L);
sort(nums2.begin(), nums2.end());
int cnt = 0;
for (int i = 0; i < nums.size(); i++) {
nums2.erase(lower_bound(nums2.begin(), nums2.end(), (long)nums[i] * 2L));
cnt += distance(nums2.begin(), lower_bound(nums2.begin(), nums2.end(), nums[i]));
}
return cnt;
}
};
137 / 137 test cases passed.
Status: Accepted