/**
* Problem: LeetCode 2089 - Find Target Indices After Sorting Array
* Difficulty: Easy
* Language: Java
* Author: CodeByTushu
*/
import java.util.ArrayList;
import java.util.List;
/**
* Problem: LeetCode 2089 - Find Target Indices After Sorting Array
* Difficulty: Easy
* Language: Java
* Author: CodeByTushu
*/
class Solution {
public List<Integer> targetIndices(int[] nums, int target) {
int less = 0, equal = 0;
for (int x : nums) {
if (x < target) less++;
else if (x == target) equal++;
}
List<Integer> result = new ArrayList<>();
for (int i = 0; i < equal; i++) {
result.add(less + i);
}
return result;
}
}
"""
Problem: LeetCode 2089 - Find Target Indices After Sorting Array
Difficulty: Easy
Language: Python
Author: CodeByTushu
"""
from typing import List
class Solution:
def targetIndices(self, nums: List[int], target: int) -> List[int]:
less = 0
equal = 0
for x in nums:
if x < target:
less += 1
elif x == target:
equal += 1
return list(range(less, less + equal))
/**
* Problem: LeetCode 2089 - Find Target Indices After Sorting Array
* Difficulty: Easy
* Language: C++
* Author: CodeByTushu
*/
#include <vector>
using namespace std;
/**
* Problem: LeetCode 2089 - Find Target Indices After Sorting Array
* Difficulty: Easy
* Language: C++
* Author: CodeByTushu
*/
class Solution {
public:
vector<int> targetIndices(vector<int>& nums, int target) {
int less = 0, equal = 0;
for (int x : nums) {
if (x < target) less++;
else if (x == target) equal++;
}
vector<int> result;
result.reserve(equal);
for (int i = 0; i < equal; i++) {
result.push_back(less + i);
}
return result;
}
};
/**
* Problem: LeetCode 2089 - Find Target Indices After Sorting Array
* Difficulty: Easy
* Language: JavaScript
* Author: CodeByTushu
*/
var targetIndices = function(nums, target) {
let less = 0;
let equal = 0;
for (const x of nums) {
if (x < target) {
less++;
} else if (x === target) {
equal++;
}
}
const result = [];
for (let i = 0; i < equal; i++) {
result.push(less + i);
}
return result;
};
TIME COMPLEXITY
O(N)
SPACE COMPLEXITY
O(1)
TOPICS
Array
Binary Search
Counting
Frequency Counting
Sorting