leetcode

0 class Solution {

1 public:

2 vector<bool> isArraySpecial(const vector<int> &nums, const vector<vector<int>> &queries) const {

3 static int vec[100001];

4

5 for (int i = 1; i < size(nums); i++) {

6 vec[i] = vec[i - 1] + (nums[i - 1] % 2 == nums[i] % 2);

7 }

8

9 vector<bool> res;

10 for (const auto &query : queries) {

11 res.push_back(vec[query[0]] == vec[query[1]]);

12 }

13

14 return res;

15 }

16 };