add 3069

Author: fishercoder1534

Diff for: paginated_contents/algorithms/4th_thousand/README.md

@@ -54,6 +54,7 @@
 | 3083 | [Existence of a Substring in a String and Its Reverse](https://leetcode.com/problems/existence-of-a-substring-in-a-string-and-its-reverse/)                                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3083.java) |                                                                               | Easy       |
 | 3079 | [Find the Sum of Encrypted Integers](https://leetcode.com/problems/find-the-sum-of-encrypted-integers/)                                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3079.java) |                                                                               | Easy       |
 | 3074 | [Apple Redistribution into Boxes](https://leetcode.com/problems/apple-redistribution-into-boxes/)                                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3074.java) |                                                                               | Easy       |
+| 3069 | [Distribute Elements Into Two Arrays I](https://leetcode.com/problems/distribute-elements-into-two-arrays-i/)                                                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3069.java) |                                                                               | Easy       |
 | 3062 | [Winner of the Linked List Game](https://leetcode.com/problems/winner-of-the-linked-list-game/)                                                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3062.java) |                                                                               | Easy       |
 | 3046 | [Split the Array](https://leetcode.com/problems/split-the-array/)                                                                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3046.java) |                                                                               | Easy       |
 | 3042 | [Count Prefix and Suffix Pairs I](https://leetcode.com/problems/count-prefix-and-suffix-pairs-i/)                                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3042.java) |                                                                               | Easy       |

Diff for: src/main/java/com/fishercoder/solutions/fourththousand/_3069.java

@@ -0,0 +1,31 @@
+package com.fishercoder.solutions.fourththousand;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class _3069 {
+    public static class Solution1 {
+        public int[] resultArray(int[] nums) {
+            int[] ans = new int[nums.length];
+            List<Integer> list1 = new ArrayList<>();
+            list1.add(nums[0]);
+            List<Integer> list2 = new ArrayList<>();
+            list2.add(nums[1]);
+            for (int i = 2; i < nums.length; i++) {
+                if (list1.get(list1.size() - 1) > list2.get(list2.size() - 1)) {
+                    list1.add(nums[i]);
+                } else {
+                    list2.add(nums[i]);
+                }
+            }
+            int i = 0;
+            for (int j = 0; j < list1.size(); j++) {
+                ans[i++] = list1.get(j);
+            }
+            for (int j = 0; j < list2.size(); j++) {
+                ans[i++] = list2.get(j);
+            }
+            return ans;
+        }
+    }
+}