feat: add solutions to lc problem: No.2089

* Add solutions to lc problem: No.2089.Find Target Indices After Sorting Array
* Update workflows

Author: yanglbme

.github/workflows/compress.yml

@@ -1,13 +1,8 @@
 name: Compress
 
 on:
-  push:
-    branches: [main]
-    paths:
-      - "**.jpg"
-      - "**.jpeg"
-      - "**.png"
-      - "**.webp"
+  schedule:
+    - cron: "0 0 * * 3"
   workflow_dispatch:
 
 jobs:

.github/workflows/contributors.yml

@@ -1,8 +1,8 @@
 name: Contributors
 
 on:
-  push:
-    branches: [main]
+  schedule:
+    - cron: "0 18 * * *"
   workflow_dispatch:
 
 jobs:

solution/2000-2099/2089.Find Target Indices After Sorting Array/README.md

@@ -65,15 +65,29 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def targetIndices(self, nums: List[int], target: int) -> List[int]:
+        nums.sort()
+        return [i for i, num in enumerate(nums) if num == target]
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public List<Integer> targetIndices(int[] nums, int target) {
+        Arrays.sort(nums);
+        List<Integer> ans = new ArrayList<>();
+        for (int i = 0; i < nums.length; ++i) {
+            if (nums[i] == target) {
+                ans.add(i);
+            }
+        }
+        return ans;
+    }
+}
 ```
 
 ### **TypeScript**
@@ -92,6 +106,37 @@ function targetIndices(nums: number[], target: number): number[] {
 };
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> targetIndices(vector<int>& nums, int target) {
+        sort(nums.begin(), nums.end());
+        vector<int> ans;
+        for (int i = 0; i < nums.size(); ++i)
+            if (nums[i] == target)
+                ans.push_back(i);
+        return ans;
+    }
+};
+```
+
+### **Go**
+
+```go
+func targetIndices(nums []int, target int) []int {
+	sort.Ints(nums)
+	var ans []int
+	for i, num := range nums {
+		if num == target {
+			ans = append(ans, i)
+		}
+	}
+	return ans
+}
+```
+
 ### **...**
 
 ```

solution/2000-2099/2089.Find Target Indices After Sorting Array/README_EN.md

@@ -61,13 +61,27 @@ The index where nums[i] == 5 is 4.
 ### **Python3**
 
 ```python
-
+class Solution:
+    def targetIndices(self, nums: List[int], target: int) -> List[int]:
+        nums.sort()
+        return [i for i, num in enumerate(nums) if num == target]
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public List<Integer> targetIndices(int[] nums, int target) {
+        Arrays.sort(nums);
+        List<Integer> ans = new ArrayList<>();
+        for (int i = 0; i < nums.length; ++i) {
+            if (nums[i] == target) {
+                ans.add(i);
+            }
+        }
+        return ans;
+    }
+}
 ```
 
 ### **TypeScript**
@@ -86,6 +100,37 @@ function targetIndices(nums: number[], target: number): number[] {
 };
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> targetIndices(vector<int>& nums, int target) {
+        sort(nums.begin(), nums.end());
+        vector<int> ans;
+        for (int i = 0; i < nums.size(); ++i)
+            if (nums[i] == target)
+                ans.push_back(i);
+        return ans;
+    }
+};
+```
+
+### **Go**
+
+```go
+func targetIndices(nums []int, target int) []int {
+	sort.Ints(nums)
+	var ans []int
+	for i, num := range nums {
+		if num == target {
+			ans = append(ans, i)
+		}
+	}
+	return ans
+}
+```
+
 ### **...**
 
 ```

solution/2000-2099/2089.Find Target Indices After Sorting Array/Solution.cpp

@@ -0,0 +1,11 @@
+class Solution {
+public:
+    vector<int> targetIndices(vector<int>& nums, int target) {
+        sort(nums.begin(), nums.end());
+        vector<int> ans;
+        for (int i = 0; i < nums.size(); ++i)
+            if (nums[i] == target)
+                ans.push_back(i);
+        return ans;
+    }
+};

solution/2000-2099/2089.Find Target Indices After Sorting Array/Solution.go

@@ -0,0 +1,10 @@
+func targetIndices(nums []int, target int) []int {
+	sort.Ints(nums)
+	var ans []int
+	for i, num := range nums {
+		if num == target {
+			ans = append(ans, i)
+		}
+	}
+	return ans
+}

solution/2000-2099/2089.Find Target Indices After Sorting Array/Solution.java

@@ -0,0 +1,12 @@
+class Solution {
+    public List<Integer> targetIndices(int[] nums, int target) {
+        Arrays.sort(nums);
+        List<Integer> ans = new ArrayList<>();
+        for (int i = 0; i < nums.length; ++i) {
+            if (nums[i] == target) {
+                ans.add(i);
+            }
+        }
+        return ans;
+    }
+}

solution/2000-2099/2089.Find Target Indices After Sorting Array/Solution.py

@@ -0,0 +1,4 @@
+class Solution:
+    def targetIndices(self, nums: List[int], target: int) -> List[int]:
+        nums.sort()
+        return [i for i, num in enumerate(nums) if num == target]