barrett/barrettruth.com
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

feat: misc cleanups

Browse source
This commit is contained in:
Barrett Ruth 2025-04-15 13:43:37 -04:00
parent 24685b693c
commit 20ca76756e
3 changed files with 1 additions and 9 deletions
Download patch file Download diff file Expand all files Collapse all files

4
public/code/algorithms/leetcode-daily/beauty.cpp
View file

@ -5,7 +5,6 @@ std::vector<int> maximumBeauty(std::vector<std::vector<int>>& items, std::vector
std::sort(items.begin(), items.end());
std::vector<std::pair<int, int>> sorted_queries;
sorted_queries.reserve(queries.size());
// couple queries with their indices
for (size_t i = 0; i < queries.size(); ++i) {
sorted_queries.emplace_back(queries[i], i);
}
@ -20,9 +19,8 @@ std::vector<int> maximumBeauty(std::vector<std::vector<int>>& items, std::vector
beauty = std::max(beauty, items[i][1]);
++i;
}
// invariant: items[i - 1] is the rightmost considerable item
ans[index] = i > 0 && items[i - 1][0] <= query ? beauty : 0;
}
return std::move(ans);
return ans;
}

1
public/code/algorithms/leetcode-daily/minend.cpp
View file

@ -4,7 +4,6 @@ long long minEnd(int n, long long x) {
while (bits_to_distribute > 0) {
if ((x & mask) == 0) {
// if the bit should be set, set it-otherwise, leave it alone
if ((bits_to_distribute & 1) == 1)
x |= mask;
bits_to_distribute >>= 1;