符号不统一,不能用滑动窗口
前缀和 + 哈希
遍历数组,记录前缀和preSum,并通过map统计该前缀和出现的次数,如果preSum = k,结果count += 1,否则,count += preSum - k出现的次数
class Solution {
public:
int subarraySum(vector<int>& nums, int k) {
int preSum = 0, count = 0;
unordered_map<int, int> hash;
for(auto num : nums) {
preSum += num;
if(preSum == k) ++count;
if(hash.find(preSum - k) != hash.end()) count += hash[preSum - k];
++hash[preSum];
}
return count;
}
};
剑指 Offer II 011. 0 和 1 个数相同的子数组
前缀和+哈希
0当作-1
class Solution {
public:
int findMaxLength(vector<int>& nums) {
map<int, int> hash;
int pre = 0, ans = 0;
for(int i = 0; i < nums.size(); ++i) {
if(nums[i] == 0){
--pre;
} else {
++pre;
}
if(pre == 0) ans = i + 1;
if(hash.find(pre) != hash.end()) {
ans = max(ans, i - hash[pre]);
} else {
hash[pre] = i;
}
}
return ans;
}
};
前缀和 注意中心点不参与左右两边求和
class Solution {
public:
int pivotIndex(vector<int>& nums) {
vector<int> Pre;
int pre = 0, n = nums.size() - 1;
for(auto num : nums) {
pre += num;
Pre.push_back(pre);
}
if(Pre[n] - Pre[0] == 0) return 0;
for(int i = 1; i < n; ++i) {
if(Pre[i - 1] == (Pre[n] - Pre[i])) return i;
}
if(Pre[n - 1] == 0) return n;
return -1;
}
};
用一个矩阵保存各个子矩阵的和
保存和的矩阵行列各加一
class NumMatrix {
public:
NumMatrix(vector<vector<int>>& matrix) {
int n = matrix.size();
int m = matrix[0].size();
for(int i = 0; i < n + 1; ++i) {
int pre = 0;
vector<int> row;
for(int j = 0; j < m + 1; ++j) {
if(i == 0 || j == 0) {
row.emplace_back(0);
continue;
}
pre += matrix[i - 1][j - 1];
row.emplace_back(sum[i - 1][j] + pre);
}
sum.emplace_back(row);
}
}
int sumRegion(int row1, int col1, int row2, int col2) {
return (sum[row2 + 1][col2 + 1] + sum[row1][col1] - sum[row1][col2 + 1] - sum[row2 + 1][col1]);
}
private:
vector<vector<int> > sum;
};
/**
* Your NumMatrix object will be instantiated and called as such:
* NumMatrix* obj = new NumMatrix(matrix);
* int param_1 = obj->sumRegion(row1,col1,row2,col2);
*/