Skip to content

Create 1394. Find Lucky Integer in an Array1 #856

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Aug 6, 2025
Merged

Create 1394. Find Lucky Integer in an Array1 #856

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
53 changes: 53 additions & 0 deletions 1394. Find Lucky Integer in an Array1
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,53 @@

#include <vector>
#include <algorithm>

class Solution {
public:
int numOfUnplacedFruits(std::vector<int>& fruits, std::vector<int>& baskets) {
int n = fruits.size();
std::vector<int> segmentTree(4 * n, 0);

// Build segment tree
build(0, 0, n - 1, baskets, segmentTree);

int unplaced = 0;
for (int fruit : fruits) {
if (!querySegmentTree(0, 0, n - 1, segmentTree, fruit)) {
unplaced++;
}
}
return unplaced;
}

private:
void build(int i, int l, int r, const std::vector<int>& baskets, std::vector<int>& segmentTree) {
if (l == r) {
segmentTree[i] = baskets[l];
return;
}
int m = (l + r) / 2;
build(2 * i + 1, l, m, baskets, segmentTree);
build(2 * i + 2, m + 1, r, baskets, segmentTree);
segmentTree[i] = std::max(segmentTree[2 * i + 1], segmentTree[2 * i + 2]);
}

bool querySegmentTree(int i, int l, int r, std::vector<int>& segmentTree, int val) {
if (segmentTree[i] < val) {
return false; // No basket in this segment
}
if (l == r) {
segmentTree[i] = -1; // Mark basket as used
return true;
}
int mid = (l + r) / 2;
bool placed;
if (segmentTree[2 * i + 1] >= val) {
placed = querySegmentTree(2 * i + 1, l, mid, segmentTree, val);
} else {
placed = querySegmentTree(2 * i + 2, mid + 1, r, segmentTree, val);
}
segmentTree[i] = std::max(segmentTree[2 * i + 1], segmentTree[2 * i + 2]);
return placed;
}
};
Loading