Added task 2089.

Author: javadev

src/main/java/g2001_2100/s2089_find_target_indices_after_sorting_array/Solution.java

@@ -0,0 +1,26 @@
+package g2001_2100.s2089_find_target_indices_after_sorting_array;
+
+// #Easy #Array #Sorting #Binary_Search #2022_05_27_Time_1_ms_(97.90%)_Space_42.5_MB_(83.38%)
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class Solution {
+ public List<Integer> targetIndices(int[] nums, int target) {
+ int count = 0;
+ int lessthan = 0;
+ for (int n : nums) {
+ if (n == target) {
+ count++;
+ }
+ if (n < target) {
+ lessthan++;
+ }
+ }
+ List<Integer> result = new ArrayList<>();
+ for (int i = 0; i < count; i++) {
+ result.add(lessthan++);
+ }
+ return result;
+ }
+}

src/main/java/g2001_2100/s2089_find_target_indices_after_sorting_array/readme.md

@@ -0,0 +1,44 @@
+2089\. Find Target Indices After Sorting Array
+
+Easy
+
+You are given a **0-indexed** integer array `nums` and a target element `target`.
+
+A **target index** is an index `i` such that `nums[i] == target`.
+
+Return _a list of the target indices of_ `nums` after _sorting_ `nums` _in **non-decreasing** order_. If there are no target indices, return _an **empty** list_. The returned list must be sorted in **increasing** order.
+
+**Example 1:**
+
+**Input:** nums = [1,2,5,2,3], target = 2
+
+**Output:** [1,2]
+
+**Explanation:** After sorting, nums is [1,**2**,**2**,3,5].
+
+The indices where nums[i] == 2 are 1 and 2. 
+
+**Example 2:**
+
+**Input:** nums = [1,2,5,2,3], target = 3
+
+**Output:** [3]
+
+**Explanation:** After sorting, nums is [1,2,2,**3**,5].
+
+The index where nums[i] == 3 is 3. 
+
+**Example 3:**
+
+**Input:** nums = [1,2,5,2,3], target = 5
+
+**Output:** [4]
+
+**Explanation:** After sorting, nums is [1,2,2,3,**5**].
+
+The index where nums[i] == 5 is 4. 
+
+**Constraints:**
+
+* `1 <= nums.length <= 100`
+* `1 <= nums[i], target <= 100`

src/test/java/g2001_2100/s2089_find_target_indices_after_sorting_array/SolutionTest.java

@@ -0,0 +1,30 @@
+package g2001_2100.s2089_find_target_indices_after_sorting_array;
+
+import static org.hamcrest.CoreMatchers.equalTo;
+import static org.hamcrest.MatcherAssert.assertThat;
+
+import java.util.Arrays;
+import org.junit.jupiter.api.Test;
+
+class SolutionTest {
+ @Test
+ void targetIndices() {
+ assertThat(
+ new Solution().targetIndices(new int[] {1, 2, 5, 2, 3}, 2),
+ equalTo(Arrays.asList(1, 2)));
+ }
+
+ @Test
+ void targetIndices2() {
+ assertThat(
+ new Solution().targetIndices(new int[] {1, 2, 5, 2, 3}, 3),
+ equalTo(Arrays.asList(3)));
+ }
+
+ @Test
+ void targetIndices3() {
+ assertThat(
+ new Solution().targetIndices(new int[] {1, 2, 5, 2, 3}, 5),
+ equalTo(Arrays.asList(4)));
+ }
+}