leetcode 第 388 场周赛 题解
100233. 重新分装苹果
简单题 贪心
class Solution {
public:
int minimumBoxes(vector<int>& apple, vector<int>& capacity) {
sort(capacity.begin(), capacity.end(), greater<int>());
int m = capacity.size(), sum = accumulate(apple.begin(), apple.end(), 0), num = 0, ans = m;
for (int i = 0; i < m; i++) {
if (num < sum) {
num += capacity[i];
} else {
ans = i;
break;
}
}
return ans;
}
};
100247. 幸福值最大化的选择方案
简单题 贪心
class Solution {
public:
long long maximumHappinessSum(vector<int>& happiness, int k) {
sort(happiness.begin(), happiness.end(), greater<int>());
long long sum = 0ll;
for (int i = 0; i < k; i++) {
int temp = max(happiness[i] - i, 0);
if (temp <= 0) break;
sum += temp;
}
return sum;
}
};
100251. 数组中的最短非公共子字符串
简单题 模拟
class Solution {
public:
vector<string> shortestSubstrings(vector<string> &arr) {
int n = arr.size(), len;
unordered_map<string, int> mp,vis;
for (int i = 0; i < n; i++) {
len = arr[i].length();
for (int j = 0; j < len; j++) {
for (int k = j; k < len; k++) {
string s = arr[i].substr(j, k - j + 1);
if (vis[s] == 0) {
++mp[s];
++vis[s];
}
}
}
vis.clear();
}
vector<string> ans(n);
for (int i = 0; i < n; i++) {
len = arr[i].length();
string temp = "";
bool flag = false;
for (int k = 1; k <= len; k++) {
for (int j = 0; j <= len - k; j++) {
string s = arr[i].substr(j, k);
if (mp[s] == 1) {
if (temp == "" || s < temp) {
temp = s;
flag = true;
}
}
}
if (flag) break;
}
ans[i] = temp;
}
return ans;
}
};
100216. K 个不相交子数组的最大能量值
困难题 前缀和+划分型DP+式子变形
视频讲解:https://www.bilibili.com/video/BV1Xr421J77b/?vd_source=731560abe8df5b2a88bbf9e188fb46f6
题解:https://leetcode.cn/problems/maximum-strength-of-k-disjoint-subarrays/solutions/2678061/qian-zhui-he-hua-fen-xing-dpshi-zi-bian-ap5z5/
class Solution {
public:
long long maximumStrength(vector<int> &nums, int k) {
int n = nums.size();
vector<long long> s(n + 1);
for (int i = 0; i < n; i++) {
s[i + 1] = s[i] + nums[i];
}
vector<vector<long long>> f(k + 1, vector<long long>(n + 1));
for (int i = 1; i <= k; i++) {
f[i][i - 1] = LLONG_MIN;
long long mmax = LLONG_MIN;
int w = (k - i + 1) * (i % 2 ? 1 : -1);
// j 不能太小也不能太大,要给前面留 i-1 个数,后面留 k-i 个数
for (int j = i; j <= n - k + i; j++) {
mmax = max(mmax, f[i - 1][j - 1] - s[j - 1] * w);
f[i][j] = max(f[i][j - 1], mmax + s[j] * w);
}
}
return f[k][n];
}
};