solves array partition I

Author: anishLearnsToCode

README.md

@@ -147,7 +147,7 @@
 | 551 | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i) | Easy | [![Java](assets/java.png)](src/StudentAttendanceRecordI.java) [![Python](assets/python.png)](python/student_attendance_record_I.py) |
 | 557 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | Easy | [![Java](assets/java.png)](src/ReverseWordsInStringIII.java) [![Python](assets/python.png)](python/reverse_words_in_string_iii.py) |
 | 559 | [Maximum Depth of N-Ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree) | Easy | [![Java](assets/java.png)](src/MaximumDepthOfNAryTree.java) [![Python](assets/python.png)](python/maximum_depth_of_n_ary_tree.py) |
-| 561 | [Array Partition I](https://leetcode.com/problems/array-partition-i) | Easy | |
+| 561 | [Array Partition I](https://leetcode.com/problems/array-partition-i) | Easy | [![Java](assets/java.png)](src/ArrayPartitionI.java) [![Python](assets/python.png)](python/array_partiton_I.py) |
 | 563 | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | Easy | |
 | 566 | [Reshape The Matrix](https://leetcode.com/problems/reshape-the-matrix) | Easy | |
 | 572 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | Easy | |

python/array_partiton_I.py

@@ -0,0 +1,10 @@
+from typing import List
+
+
+class Solution:
+    def arrayPairSum(self, nums: List[int]) -> int:
+        nums.sort()
+        result = 0
+        for i in range(0, len(nums) // 2):
+            result += min(nums[2 * i], nums[2 * i + 1])
+        return result

src/ArrayPartitionI.java

@@ -0,0 +1,12 @@
+import java.util.Arrays;
+
+public class ArrayPartitionI {
+    public int arrayPairSum(int[] nums) {
+        Arrays.sort(nums);
+        int result = 0;
+        for (int index = 0 ; index < nums.length ; index += 2) {
+            result += Math.min(nums[index], nums[index + 1]);
+        }
+        return result;
+    }
+}