mirror of https://github.com/doocs/leetcode.git
19 lines
538 B
Java
19 lines
538 B
Java
class Solution {
|
|
public boolean[] isArraySpecial(int[] nums, int[][] queries) {
|
|
int n = nums.length;
|
|
int[] d = new int[n];
|
|
for (int i = 1; i < n; ++i) {
|
|
if (nums[i] % 2 != nums[i - 1] % 2) {
|
|
d[i] = d[i - 1];
|
|
} else {
|
|
d[i] = i;
|
|
}
|
|
}
|
|
int m = queries.length;
|
|
boolean[] ans = new boolean[m];
|
|
for (int i = 0; i < m; ++i) {
|
|
ans[i] = d[queries[i][1]] <= queries[i][0];
|
|
}
|
|
return ans;
|
|
}
|
|
} |