Solution (leetcode-in-java 1.20 API)

java.lang.Object
- g0401_0500.s0493_reverse_pairs.Solution

```
public class Solution
extends Object
```
493 - Reverse Pairs.
Hard

Given an integer array nums, return the number of reverse pairs in the array.

A reverse pair is a pair (i, j) where 0 <= i < j < nums.length and nums[i] > 2 * nums[j].

Example 1:

Input: nums = [1,3,2,3,1]

Output: 2

Example 2:

Input: nums = [2,4,3,5,1]

Output: 3

Constraints:
- 1 <= nums.length <= 5 * 10⁴
- -2³¹ <= nums[i] <= 2³¹ - 1

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int reversePairs(int[] nums)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

reversePairs

public int reversePairs(int[] nums)