Given an integer array nums, return the number of reverse pairs — pairs (i,j) where 0<=i<j<=n-1 and nums[i] > 2 * nums[j].
Input: Integer array nums.
Output: Integer — count of reverse pairs.
Input: [1,3,2,3,1]
Output: 2
Explanation: (1,4): 3>2*1=2. (3,4): 3>2*1=2. Count=2.Input: [2,4,3,5,1]
Output: 3
Explanation: (0,4): 2>2. No. (1,4): 4>2. (2,4): 3>2. (3,4): 5>2. Count=3.Input: [1,2,3,4,5]
Output: 0
Explanation: No reverse pairs.1<=nums.length<=5*10^4-2^31<=nums[i]<=2^31-1