add 3131

Author: fishercoder1534

README.md

@@ -8,10 +8,11 @@ _If you like this project, please leave me a star._ ★
 
 | #    |      Title     | Solutions                                                                                                                                | Video                                                                         | Difficulty                       | Tag                                                                  
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|----------------------------------------------------------------------
+| 3131 |[Find the Integer Added to Array I](https://leetcode.com/problems/find-the-integer-added-to-array-i/)| [Java](../master/src/main/java/com/fishercoder/solutions/_3131.java)                                                                     |                                           | Easy                             |
 | 3046 |[Split the Array](https://leetcode.com/problems/split-the-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_3046.java)                                                                     |                                           | Easy                             |
 | 3042 |[Count Prefix and Suffix Pairs I](https://leetcode.com/problems/count-prefix-and-suffix-pairs-i/)| [Java](../master/src/main/java/com/fishercoder/solutions/_3042.java)                                                                     |                                           | Easy                             |
 | 3038 |[Maximum Number of Operations With the Same Score I](https://leetcode.com/problems/maximum-number-of-operations-with-the-same-score-i/)| [Java](../master/src/main/java/com/fishercoder/solutions/_3038.java)                                                                     |                                           | Easy                             |
-| 3033 |[Modify the Matrix](https://leetcode.com/problems/modify-the-matrix/)| [Java](../master/src/main/java/com/fishercoder/solutions/_3033.java)                                                                      |                                           | Easy                             |
+| 3033 |[Modify the Matrix](https://leetcode.com/problems/modify-the-matrix/)| [Java](../master/src/main/java/com/fishercoder/solutions/_3033.java)                                                                     |                                           | Easy                             |
 | 3006 |[Find Beautiful Indices in the Given Array I](https://leetcode.com/problems/find-beautiful-indices-in-the-given-array-i/)| [Java](../master/src/main/java/com/fishercoder/solutions/_3006.java)                                                                     |                                           | Medium                           |
 | 3005 |[Count Elements With Maximum Frequency](https://leetcode.com/problems/count-elements-with-maximum-frequency/)| [Java](../master/src/main/java/com/fishercoder/solutions/_3005.java)                                                                     |                                           | Easy                             |
 | 2716 |[Minimize String Length](https://leetcode.com/problems/minimize-string-length/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2716.java)                                                                     | [:tv:](https://youtu.be/aMJ3T0K8LjI)                                          | Easy                             |

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

@@ -0,0 +1,13 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+public class _3131 {
+    public static class Solution1 {
+        public int addedInteger(int[] nums1, int[] nums2) {
+            Arrays.sort(nums1);
+            Arrays.sort(nums2);
+            return nums2[0] - nums1[0];
+        }
+    }
+}