add 2070

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2070|[Check Whether Two Strings are Almost Equivalent](https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2068.java) ||Easy||
 |2068|[Check Whether Two Strings are Almost Equivalent](https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2068.java) ||Easy||
 |2063|[Vowels of All Substrings](https://leetcode.com/problems/vowels-of-all-substrings/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2063.java) ||Medium||
 |2062|[Count Vowel Substrings of a String](https://leetcode.com/problems/count-vowel-substrings-of-a-string/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2062.java) ||Easy||

src/main/java/com/fishercoder/solutions/_2070.java

@@ -0,0 +1,31 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+public class _2070 {
+    public static class Solution1 {
+        public int[] maximumBeauty(int[][] items, int[] queries) {
+            int len = queries.length;
+            Arrays.sort(items, (a, b) -> Integer.compare(a[0], b[0]));
+            int[][] queryPairs = new int[len][2];
+            for (int i = 0; i < len; i++) {
+                queryPairs[i] = new int[]{queries[i], i};
+            }
+            Arrays.sort(queryPairs, (a, b) -> Integer.compare(a[0], b[0]));
+            int[] ans = new int[len];
+            int j = 0;
+            int max = 0;
+            for (int i = 0; i < len; i++) {
+                int[] queryPair = queryPairs[i];
+                int price = queryPair[0];
+                int index = queryPair[1];
+                while (j < items.length && items[j][0] <= price) {
+                    max = Math.max(max, items[j][1]);
+                    j++;
+                }
+                ans[index] = max;
+            }
+            return ans;
+        }
+    }
+}

src/test/java/com/fishercoder/_2070Test.java

@@ -0,0 +1,45 @@
+package com.fishercoder;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions._2070;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+public class _2070Test {
+    private static _2070.Solution1 solution1;
+    private static int[][] items;
+    private static int[] queries;
+    private static int[] expected;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _2070.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        items = CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[1,2],[3,2],[2,4],[5,6],[3,5]");
+        queries = new int[]{1, 2, 3, 4, 5, 6};
+        expected = new int[]{2, 4, 5, 5, 6, 6};
+        assertArrayEquals(expected, solution1.maximumBeauty(items, queries));
+    }
+
+    @Test
+    public void test2() {
+        items = CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[1,2],[1,2],[1,3],[1,4]");
+        queries = new int[]{1};
+        expected = new int[]{4};
+        assertArrayEquals(expected, solution1.maximumBeauty(items, queries));
+    }
+
+    @Test
+    public void test3() {
+        items = CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[10,1000]");
+        queries = new int[]{5};
+        expected = new int[]{0};
+        assertArrayEquals(expected, solution1.maximumBeauty(items, queries));
+    }
+
+}