赞
踩
满足条件为0 , 不满足为1
class Solution { public: vector<bool> isArraySpecial(vector<int>& nums, vector<vector<int>>& queries) { int n = nums.size(); vector<int> s(n); for(int i=1;i<n;i++) { s[i] = s[i - 1] + (nums[i] % 2 == nums[i-1] % 2); } vector<bool> ans(queries.size()); for(int i=0;i<queries.size();i++) { auto &q = queries[i]; ans[i] = s[q[0]] == s[q[1]]; } return ans; } };
Copyright © 2003-2013 www.wpsshop.cn 版权所有,并保留所有权利。