100243. 将元素分配到两个数组中 I
原题链接
将元素分配到两个数组中 I - 力扣 (LeetCode) 竞赛
思路分析
直接模拟即可
AC代码
class Solution:
def resultArray(self, nums: List[int]) -> List[int]:
a, b = [nums[0]], [nums[1]]
n = len(nums)
for i in range(2, n):
if a[-1] > b[-1]:
a.append(nums[i])
else:
b.append(nums[i])
return a + b
100237. 元素和小于等于 k 的子矩阵的数目
原题链接
元素和小于等于 k 的子矩阵的数目 - 力扣 (LeetCode) 竞赛
思路分析
计算二维前缀和,然后枚举一遍即可
AC代码
class Solution
{
public:
int countSubmatrices(vector<vector<int>> &grid, int k)
{
int m = grid.size(), n = grid[0].size(), ret = 0;
for (int i = 1; i < n; i++)
grid[0][i] += grid[0][i - 1];
for (int i = 1; i < m; i++)
grid[i][0] += grid[i - 1][0];
for (int i = 1; i < m; i++)
for (int j = 1; j < n; j++)
grid[i][j] += grid[i - 1][j] + grid[i][j - 1] - grid[i - 1][j - 1];
for (int i = 0; i < m; i++)
for (int j = 0; j < n; j++)
if (grid[i][j] <= k)
ret++;
return ret;
}
};
100234. 在矩阵上写出字母 Y 所需的最少操作次数
原题链接
在矩阵上写出字母 Y 所需的最少操作次数 - 力扣 (LeetCode) 竞赛
思路分析
分别计算Y和其它位置内0、1、2的数目,然后计算6种结果最小值即可
AC代码
class Solution
{
public:
int minimumOperationsToWriteY(vector<vector<int>> &grid)
{
int cnty[3]{0}, cnt[3]{0}, n = grid[0].size(), res = INT_MAX, sy = 0, s = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if ((i <= n / 2 && (i == j || n - 1 - j == i)) || (j == n / 2 && i >= n / 2))
cnty[grid[i][j]]++, sy++;
else
cnt[grid[i][j]]++, s++;
for (int i = 0; i <= 2; i++)
for (int j = 0; j <= 2; j++)
{
if (i == j)
continue;
res = min(res, sy - cnty[i] + s - cnt[j]);
}
return res;
}
};
100246. 将元素分配到两个数组中 II
原题链接
将元素分配到两个数组中 II - 力扣 (LeetCode) 竞赛
思路分析
树状数组维护两个数组内小于x的数目,然后模拟即可
AC代码
int tr1[100005], tr2[100005];
class Solution
{
public:
void add(int *tr, int x)
{
for (; x <= 100000; x += (x & -x))
tr[x]++;
}
int query(int *tr, int x)
{
int res = 0;
for (; x > 0; x &= (x - 1))
res += tr[x];
return res;
}
vector<int> resultArray(vector<int> &nums)
{
memset(tr1, 0, sizeof tr1), memset(tr2, 0, sizeof tr2);
vector<int> id(nums), a(1, nums[0]), b(1, nums[1]);
sort(id.begin(), id.end());
unique(id.begin(), id.end());
int tot = id.size(), n = nums.size();
function<int(int)> idx = [&](int x)
{
return lower_bound(id.begin(), id.end(), x) - id.begin() + 1;
};
add(tr1, idx(nums[0])), add(tr2, idx(nums[1]));
for (int i = 2; i < n; i++)
{
int s1 = (int)a.size() - query(tr1, idx(nums[i])), s2 = (int)b.size() - query(tr2, idx(nums[i]));
//cout << s1 << " " << s2 << '\n';
if (s1 > s2)
a.emplace_back(nums[i]), add(tr1, idx(nums[i]));
else if (s1 < s2)
b.emplace_back(nums[i]), add(tr2, idx(nums[i]));
else if (a.size() <= b.size())
a.emplace_back(nums[i]), add(tr1, idx(nums[i]));
else
b.emplace_back(nums[i]), add(tr2, idx(nums[i]));
}
for (auto x : b)
a.emplace_back(x);
return a;
}
};