[LEET-3379] add 3379

fishercoder1534 · fishercoder1534 · commit d4211718e05f · 2025-01-05T15:33:41.000-08:00
diff --git a/paginated_contents/algorithms/4th_thousand/README.md b/paginated_contents/algorithms/4th_thousand/README.md
@@ -2,6 +2,7 @@
 |------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|------------|----------------------------------------------------------------------
 | 3396 | [Minimum Number of Operations to Make Elements in Array Distinct](https://leetcode.com/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3396.java) |                                                                               | Easy       |
 | 3392 | [Count Subarrays of Length Three With a Condition](https://leetcode.com/problems/count-subarrays-of-length-three-with-a-condition/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3392.java) |                                                                               | Easy       |
+| 3379 | [Transformed Array](https://leetcode.com/problems/transformed-array/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3379.java) |                                                                               | Easy       |
 | 3375 | [Minimum Operations to Make Array Values Equal to K](https://leetcode.com/problems/minimum-operations-to-make-array-values-equal-to-k/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3375.java) |                                                                               | Easy       |
 | 3370 | [Smallest Number With All Set Bits](https://leetcode.com/problems/smallest-number-with-all-set-bits/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3370.java) |                                                                               | Easy       |
 | 3364 | [Minimum Positive Sum Subarray](https://leetcode.com/problems/minimum-positive-sum-subarray/)                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3364.java) |                                                                               | Easy       |
diff --git a/src/main/java/com/fishercoder/solutions/fourththousand/_3379.java b/src/main/java/com/fishercoder/solutions/fourththousand/_3379.java
@@ -0,0 +1,26 @@
+package com.fishercoder.solutions.fourththousand;
+
+public class _3379 {
+    public static class Solution1 {
+        public int[] constructTransformedArray(int[] nums) {
+            int[] result = new int[nums.length];
+            int len = nums.length;
+            for (int i = 0; i < len; i++) {
+                if (nums[i] > 0) {
+                    int moves = nums[i] % len;
+                    result[i] = nums[(i + moves) % len];
+                } else if (nums[i] < 0) {
+                    if (i + nums[i] >= 0) {
+                        result[i] = nums[i + nums[i]];
+                    } else {
+                        int moves = Math.abs(nums[i]) % len;
+                        result[i] = nums[(len + (i - moves)) % len];
+                    }
+                } else {
+                    result[i] = nums[i];
+                }
+            }
+            return result;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/fourththousand/_3379Test.java b/src/test/java/com/fishercoder/fourththousand/_3379Test.java
@@ -0,0 +1,34 @@
+package com.fishercoder.fourththousand;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+
+import com.fishercoder.solutions.fourththousand._3379;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+public class _3379Test {
+    private _3379.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3379.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertArrayEquals(
+                new int[] {1, 1, 1, 3},
+                solution1.constructTransformedArray(new int[] {3, -2, 1, 1}));
+    }
+
+    @Test
+    public void test2() {
+        assertArrayEquals(
+                new int[] {-1, -1, 4}, solution1.constructTransformedArray(new int[] {-1, 4, -1}));
+    }
+
+    @Test
+    public void test3() {
+        assertArrayEquals(new int[] {-10}, solution1.constructTransformedArray(new int[] {-10}));
+    }
+}
