refactor 350

fishercoder1534 · fishercoder1534 · commit 850a318938c8 · 2020-06-10T11:50:27.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_350.java b/src/main/java/com/fishercoder/solutions/_350.java
@@ -6,23 +6,6 @@
 import java.util.Map;
 import java.util.Arrays;
 
-/**
- * 350. Intersection of Two Arrays II
- *
- * Given two arrays, write a function to compute their intersection.
-
- Example:
- Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].
-
- Note:
- Each element in the result should appear as many times as it shows in both arrays.
- The result can be in any order.
-
- Follow up:
- What if the given array is already sorted? How would you optimize your algorithm?
- What if nums1's size is small compared to nums2's size? Which algorithm is better?
- What if elements of nums2 are stored on disk, and the memory is limited such that you cannot load all elements into the memory at once?
- */
 public class _350 {
 
     public static class Solution1 {
