A 计算列车到站时间
模运算
class Solution {
public:
int findDelayedArrivalTime(int arrivalTime, int delayedTime) {
return (arrivalTime+delayedTime)%24;
}
};
B 倍数求和
模拟
class Solution {
public:
int sumOfMultiples(int n) {
int res = 0;
for (int i = 1; i <= n; i++)
if (i % 3 == 0 || i % 5 == 0 || i % 7 == 0)
res+=i;
return res;
}
};
C 滑动子数组的美丽值
滑动窗口:因为数组值域[-50,50]范围很小,所以可以使用滑动窗口枚举大小为k的子数组,同时维护每个值在子数组中出现的次数cnt(val),假设cnt(val)的前缀和为s(val),满足s(val)>=x的最小val即为当前子数组的第x小数
class Solution {
public:
vector<int> getSubarrayBeauty(vector<int> &a, int k, int x) {
int n = a.size();
int cnt[105];
int c = 50;
memset(cnt, 0, sizeof(cnt));
for (int i = 0; i < k - 1; i++)
cnt[c + a[i]]++;
vector<int> res;
for (int l = 0, r = k - 1; r < n; l++, r++) {
cnt[c + a[r]]++;
int s = 0;
for (int i = -50; i <= 50; i++) {
s += cnt[c + i];
if (s >= x) {
res.push_back(min(i,0));
break;
}
}
cnt[c + a[l]]--;
}
return res;
}
};
D 使数组所有元素变成 1 的最少操作次数
贪心: 若数组有1的情况,显然答案为数组长-1的个数,考虑其他情况,我们想尽快产生1个1,然后就可以用n-1个操作将其余n-1个数变为1,所以需要求公因数为1的区间的最小长度len,答案即为len-1+(n-1),因为数组长度范围小可以直接区间dp求,若数组长度范围较大,可以用二分枚举答案+滑动窗口维护质因数出现次数进行判断
class Solution {
public:
int minOperations(vector<int> &a) {
int n = a.size();
int c1 = 0;
for (auto x: a)
if (x == 1)
c1++;
if (c1)
return n - c1;
int g[n][n];
for (int len = 1; len <= n; len++) {
int have1 = 0;
for (int i = 0, j = i + len - 1; j < n; i++, j++) {
g[i][j] = i == j ? a[i] : gcd(g[i][j - 1], a[j]);
if (g[i][j] == 1)
have1 = 1;
}
if (have1)
return n + len - 2;
}
return -1;
}
};