feat: add python and java solutions to leetcode problem: No.1460

1460. Make Two Arrays Equal by Reversing Sub-arrays

Author: yanglbme

solution/1400-1499/1460.Make Two Arrays Equal by Reversing Sub-arrays/README.md

@@ -65,22 +65,34 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+只要两数组元素均相同，那么就能通过翻转使得两个数组相等。
+
+因此，对两数组进行排序，然后判断两数组是否相同即可。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def canBeEqual(self, target: List[int], arr: List[int]) -> bool:
+        return sorted(target) == sorted(arr)
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public boolean canBeEqual(int[] target, int[] arr) {
+        Arrays.sort(target);
+        Arrays.sort(arr);
+        return Arrays.equals(target, arr);
+    }
+}
 ```
 
 ### **...**

solution/1400-1499/1460.Make Two Arrays Equal by Reversing Sub-arrays/README_EN.md

@@ -70,13 +70,21 @@ There are multiple ways to convert arr to target, this is not the only way to do
 ### **Python3**
 
 ```python
-
+class Solution:
+    def canBeEqual(self, target: List[int], arr: List[int]) -> bool:
+        return sorted(target) == sorted(arr)
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public boolean canBeEqual(int[] target, int[] arr) {
+        Arrays.sort(target);
+        Arrays.sort(arr);
+        return Arrays.equals(target, arr);
+    }
+}
 ```
 
 ### **...**

solution/1400-1499/1460.Make Two Arrays Equal by Reversing Sub-arrays/Solution.java

@@ -0,0 +1,7 @@
+class Solution {
+    public boolean canBeEqual(int[] target, int[] arr) {
+        Arrays.sort(target);
+        Arrays.sort(arr);
+        return Arrays.equals(target, arr);
+    }
+}

solution/1400-1499/1460.Make Two Arrays Equal by Reversing Sub-arrays/Solution.py

@@ -0,0 +1,3 @@
+class Solution:
+    def canBeEqual(self, target: List[int], arr: List[int]) -> bool:
+        return sorted(target) == sorted(arr)