第一题:
1.题目: 2367. 算术三元组的数目 - 力扣(LeetCode)
2.思路: 使用for遍历所有可能的i,j,k,遇到满足题目要求的res++
class Solution {
public:
int arithmeticTriplets(vector<int>& nums, int diff) {
int res = 0;
int n = nums.size();
for(int i = 0; i < n - 2; i++){
for(int j = i + 1; j < n -1; j ++) {
for(int k = j + 1; k < n ; k ++) {
if(nums[j] - nums[i] != diff) k = n - 1; //不满足条件,进入下次循环
if(nums[j] - nums[i] == diff && nums[k] - nums[j] == diff) res++; //满足条件结果++
}
}
}
return res;
}
};
第二题:
1.题目:2368. 受限条件下可到达节点的数目 - 力扣(LeetCode)
2.思路:不进入被限制的节点,从起点0开始进行dfs
class Solution {
vector<vector<int>> e;
vector<bool> ban;
int ans;
void dfs(int sn, int fa) {
ans++;
for (int fn : e[sn]) if (fn != fa && !ban[fn]) dfs(fn, sn);
}
public:
int reachableNodes(int n, vector<vector<int>>& edges, vector<int>& restricted) {
e.resize(n); ban.resize(n);
for (auto &vec : edges) e[vec[0]].push_back(vec[1]), e[vec[1]].push_back(vec[0]);
for (int x : restricted) ban[x] = true;
dfs(0, -1);
return ans;
}