1.题目:2427. 公因子的数目 - 力扣(LeetCode)
解析:从1到b找出可以被a和b同时整除的数
class Solution {
public:
int commonFactors(int a, int b) {
int count = 1;
int res = 0;
while(count <= b) {
if(a % count == 0) {
if(b % count == 0) res ++;
}
count ++;
}
return res;
}
};
2.题目:2428. 沙漏的最大总和 - 力扣(LeetCode)
解析: 遍历整个矩阵,比较每个沙漏大小
class Solution {
public:
int maxSum(vector<vector<int>>& grid) {
int m = grid.size();
int n = grid[0].size();
int res = 0;
for (int i = 1; i < m - 1; i++) {
for (int j = 1; j < n - 1; j++) {
int sum = grid[i][j] + grid[i-1][j] + grid[i-1][j-1] + grid[i-1][j+1] +grid[i+1][j] + grid[i+1][j-1] + grid[i+1][j+1];
res = max(ans, sum);
} //根据题意算出每个沙漏的大小,保留最大值
}
return res;
}
};