Skip to content

Commit 97aef60

Browse files
add 2089
1 parent bb21e48 commit 97aef60

File tree

2 files changed

+21
-0
lines changed

2 files changed

+21
-0
lines changed

README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
88

99
| # | Title | Solutions | Video | Difficulty | Tag
1010
|-----|----------------|---------------|--------|-------------|-------------
11+
|2089|[Find Target Indices After Sorting Array](https://leetcode.com/problems/find-target-indices-after-sorting-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2089.java) ||Easy||
1112
|2086|[Minimum Number of Buckets Required to Collect Rainwater from Houses](https://leetcode.com/problems/minimum-number-of-buckets-required-to-collect-rainwater-from-houses/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2086.java) ||Medium||
1213
|2085|[Count Common Words With One Occurrence](https://leetcode.com/problems/count-common-words-with-one-occurrence/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2085.java) ||Easy||
1314
|2080|[Range Frequency Queries](https://leetcode.com/problems/range-frequency-queries/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2080.java) ||Medium|Array, Binary Search|
Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
package com.fishercoder.solutions;
2+
3+
import java.util.ArrayList;
4+
import java.util.Arrays;
5+
import java.util.List;
6+
7+
public class _2089 {
8+
public static class Solution1 {
9+
public List<Integer> targetIndices(int[] nums, int target) {
10+
List<Integer> ans = new ArrayList<>();
11+
Arrays.sort(nums);
12+
for (int i = 0; i < nums.length; i++) {
13+
if (nums[i] == target) {
14+
ans.add(i);
15+
}
16+
}
17+
return ans;
18+
}
19+
}
20+
}

0 commit comments

Comments
 (0)