leetcode

0 class Solution {

1 public:

2 vector<int> resultsArray(const vector<int> &nums, int k) const {

3 const int n = size(nums);

4 vector<int> res(n - k + 1, -1);

5

6 for (int i = 0; i <= n - k; i++) {

7 for (int j = i + 1; j < i + k; j++) {

8 if (nums[j - 1] + 1 == nums[j]) continue;

9 i = j - 1;

10 goto next;

11 }

12 res[i] = nums[i + k - 1];

13 next:;

14 }

15

16 return res;

17 }

18 };