refaactor 398

fishercoder1534 · fishercoder1534 · commit 24bdcdbe0b48 · 2020-07-01T06:56:12.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_398.java b/src/main/java/com/fishercoder/solutions/_398.java
@@ -3,25 +3,6 @@
 import java.util.ArrayList;
 import java.util.List;
 
-/**
- * 398. Random Pick Index
- *
- * Given an array of integers with possible duplicates,
- * randomly output the index of a given target number. You can assume that the given target number must exist in the array.
-
- Note:
- The array size can be very large. Solution that uses too much extra space will not pass the judge.
-
- Example:
-
- int[] nums = new int[] {1,2,3,3,3};
- Solution solution = new Solution(nums);
-
- // pick(3) should return either index 2, 3, or 4 randomly. Each index should have equal probability of returning.
- solution.pick(3);
-
- // pick(1) should return 0. Since in the array only nums[0] is equal to 1.
- solution.pick(1);*/
 public class _398 {
 
     //TODO: use reservoir sampling to solve it again
