refactor 493

fishercoder1534 · fishercoder1534 · commit aa615859d586 · 2020-07-15T07:59:00.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_493.java b/src/main/java/com/fishercoder/solutions/_493.java
@@ -2,26 +2,6 @@
 
 import java.util.Arrays;
 
-/**
- * 493. Reverse Pairs
- *
- * 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:
- The length of the given array will not exceed 50,000.
- All the numbers in the input array are in the range of 32-bit integer.
- */
 public class _493 {
 
     public static class Solution1 {
