剑指 Offer II 010. 和为 k 的子数组
前缀和加哈希
class Solution {
public:
int subarraySum(vector<int>& nums, int k) {
int n=nums.size();
vector<int>pre(n+1);
//pre[0]=nums[0];
unordered_map<int,int>mp;
mp.clear();
mp[0]=1;
int ans=0;
for(int i=1;i<=n;i++){
pre[i]=pre[i-1]+nums[i-1];
ans+=mp[pre[i]-k];
mp[pre[i]]++;
}
return ans;
}
};
剑指 Offer II 011. 0 和 1 个数相同的子数组
将0看成-1,同样前缀和加哈希
class Solution {
public:
int findMaxLength(vector<int>& nums) {
int n=nums.size();
unordered_map<int,int>mp;
int counnt=0;
mp[counnt]=-1;
int mmax=0;
for(int i=0;i<n;i++){
if(nums[i]==1) counnt++;
else counnt--;
if(mp.find(counnt)!=mp.end()) mmax=max(mmax,i-mp[counnt]);
else mp[counnt]=i;
}
return mmax;
}
};
剑指 Offer II 012. 左右两边子数组的和相等
双指针
class Solution {
public:
int pivotIndex(vector<int>& nums) {
int left=0;
int right=0;
for(int i=0;i<nums.size();i++){
right+=nums[i];
}
for(int i=0;i<nums.size();i++){
right-=nums[i];
if(i==0){
if(left==right) return i;
}
else{
left+=nums[i-1];
if(left==right) return i;
}
}
return -1;
}
};
class NumMatrix {
public:
int pre[201][201];
NumMatrix(vector<vector<int>>& matrix) {
pre[0][0]=matrix[0][0];
for(int i=1;i<matrix.size();i++) pre[i][0]=matrix[i][0]+pre[i-1][0];
for(int i=1;i<matrix[0].size();i++) pre[0][i]=matrix[0][i]+pre[0][i-1];
for(int i=1;i<matrix.size();i++){
for(int j=1;j<matrix[i].size();j++){
pre[i][j]=pre[i-1][j]+pre[i][j-1]-pre[i-1][j-1]+matrix[i][j];
}
}
}
int sumRegion(int row1, int col1, int row2, int col2) {
if(row1==0&&col1==0) return pre[row2][col2];
else if(row1==0) return pre[row2][col2]-pre[row2][col1-1];
else if(col1==0) return pre[row2][col2]-pre[row1-1][col2];
else return pre[row2][col2]-pre[row2][col1-1]-pre[row1-1][col2]+pre[row1-1][col1-1];
}
};
/**
* Your NumMatrix object will be instantiated and called as such:
* NumMatrix* obj = new NumMatrix(matrix);
* int param_1 = obj->sumRegion(row1,col1,row2,col2);
*/