Skip to content
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

feat: add TypeScript solutions to lc problem: No.2406 #2738

Merged
merged 4 commits into from
May 7, 2024
Merged

feat: add TypeScript solutions to lc problem: No.2406 #2738

Changes from 1 commit
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
229538f
feat: add TypeScript solutions to lc problem: No.2406
cblh May 7, 2024
b5ef5ac
Update README.md
yanglbme May 7, 2024
5835dc6
Update README_EN.md
yanglbme May 7, 2024
25ea716
Update Solution.ts
yanglbme May 7, 2024
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
Prev Previous commit
Next Next commit
Update README.md
  • Loading branch information
@yanglbme
yanglbme authored May 7, 2024
commit b5ef5ace735349e55b349e078281fb9ea855f003
12 changes: 4 additions & 8 deletions solution/2400-2499/2406.Divide Intervals Into Minimum Number of Groups/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -133,16 +133,12 @@ func (h *hp) Pop() any {
```ts
function minGroups(intervals: number[][]): number {
intervals.sort((a, b) => a[0] - b[0]);
const q = new PriorityQueue({
compare: (e1, e2) => {
return e1 - e2;
},
});
for (const e of intervals) {
if (!q.isEmpty() && q.front() < e[0]) {
const q = new PriorityQueue({ compare: (a, b) => a - b });
for (const [l, r] of intervals) {
if (!q.isEmpty() && q.front() < l) {
q.dequeue();
}
q.enqueue(e[1]);
q.enqueue(r);
}
return q.size();
}
Expand Down
Loading