_3254.java

packagecom.fishercoder.solutions.fourththousand;

importjava.util.Arrays;

publicclass_3254 {
publicstaticclassSolution1 {
publicint[] resultsArray(int[] nums, intk) {
intn = nums.length;
int[] ans = newint[n - k + 1];
booleansorted;
if (k == 1) {
returnnums;
 }
Arrays.fill(ans, -1);
for (inti = 0; i <= n - k; i++) {
sorted = true;
for (intj = i + 1; j < i + k; j++) {
if (nums[j] != nums[j - 1] + 1) {
sorted = false;
break;
 }
 }
if (sorted) {
ans[i] = nums[i + k - 1];
 }
 }
returnans;
 }
 }
}