Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

refactor: js - intervals#449

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.

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

Already on GitHub?Sign in to your account

Merged
mitchellirvin merged 1 commit intoneetcode-gh:mainfromaakhtar3:intervals
Jul 30, 2022
Merged
Show file tree
Hide file tree
Changes fromall commits
Commits
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
34 changes: 25 additions & 9 deletionsjavascript/252-Meeting-Rooms.js
View file
Open in desktop
Original file line numberDiff line numberDiff line change
@@ -1,14 +1,30 @@
/**
* @param {number[]} intervals
* https://leetcode.com/problems/meeting-rooms/
* Time O(N * logN) | Space O(1)
* @param {number[][]} intervals
* @return {boolean}
*/
var canAttendMeetings = function (intervals) {
intervals.sort((a, b) => a[0] - b[0]);
var canAttendMeetings = function(intervals) {
intervals.sort(([ aStart, aEnd ], [ bStart, bEnd ]) => aStart !== bStart
? aStart - bStart
: aEnd - bEnd
);

for (let i = 0; i < intervals.length - 1; i++) {
if (intervals[i][1] > intervals[i + 1][0]) {
return false;
}
}
return true;
return canAttend(intervals)
};

const canAttend = (intervals) => {
let prev = intervals.shift();

for (const curr of intervals) {
const [ prevStart, prevEnd ] = prev;
const [ currStart, currEnd ] = curr;

const hasOverlap = currStart < prevEnd;
if (hasOverlap) return false;

prev = curr;
}

return true;
}
39 changes: 39 additions & 0 deletionsjavascript/253-Meeting-Rooms-ii.js
View file
Open in desktop
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,39 @@
/**
* https://leetcode.com/problems/meeting-rooms-ii/
* Time O((N * logN) + (M * logM)) | Space O(1)
* @param {number[][]} intervals
* @return {number}
*/
var minMeetingRooms = function(intervals) {
const { start, end } = splitIntervals(intervals);
let [ minRooms, startIndex, endIndex ] = [ 0, 0, 0 ];

while (startIndex < intervals.length) {
const [ currStart, prevEnd ] = [ start[startIndex], end[endIndex] ];

const hasGap = prevEnd <= currStart;
if (hasGap) {
minRooms--;
endIndex++;
}

minRooms++;
startIndex++;
}

return minRooms;
};

const splitIntervals = (intervals, start = [], end = []) => {
for (const [ startTime, endTime ] of intervals) {
start.push(startTime);
end.push(endTime);
}

const comparator = ((a, b) => a - b);

start.sort(comparator);
end.sort(comparator);

return { start, end };
};
40 changes: 27 additions & 13 deletionsjavascript/435-Non-overlapping-Intervals.js
View file
Open in desktop
Original file line numberDiff line numberDiff line change
@@ -1,17 +1,31 @@
let eraseOverlapIntervals = function (intervals) {
intervals = intervals.sort((a, b) => a[0] - b[1]);
/**
* https://leetcode.com/problems/non-overlapping-intervals/
* Time O(N * logN) | Space O(1)
* @param {number[][]} intervals
* @return {number}
*/
var eraseOverlapIntervals = function(intervals) {
intervals.sort(([ aStart, aEnd ], [ bStart, bEnd ]) => aEnd !== bEnd
? aEnd - bEnd
: aStart - bStart
);

let currentEnd = intervals[0][1];
let res = 0;
return getGaps(intervals)
};

const getGaps = (intervals, gaps = 1) => {
const prev = intervals.shift();

for (const curr of intervals) {
const [ prevStart, prevEnd ] = prev;
const [ currStart, currEnd ] = curr;

for (let i = 1; i < intervals.length; i++) {
if (currentEnd > intervals[i][0]) {
res += 1;
currentEnd = Math.min(intervals[i][1], currentEnd);
} else {
currentEnd = intervals[i][1];
}
const hasGap = prevEnd <= currStart;
if (!hasGap) continue;

prev[1] = curr[1];
gaps++;
}

returnres;
};
return(intervals.length + 1) - gaps;
}
40 changes: 29 additions & 11 deletionsjavascript/56-Merge-Intervals.js
View file
Open in desktop
Original file line numberDiff line numberDiff line change
@@ -1,16 +1,34 @@
var merge = function (intervals) {
intervals.sort((a, b) => a[0] - b[0]);
/**
* https://leetcode.com/problems/merge-intervals/
* Time O(N * logN) | Space O(N)
* @param {number[][]} intervals
* @return {number[][]}
*/
var merge = function(intervals) {
intervals.sort(([ aStart, aEnd ], [ bStart, bEnd ]) => aStart !== bStart
? aStart - bStart
: aEnd - bEnd
);

let res = [intervals[0]];
return mergerInterval(intervals)
};

const mergerInterval = (intervals, merged = []) => {
let prev = intervals.shift();

for (let i = 1; i < intervals.length; i++) {
let prev = res[res.length - 1];
for (const curr of intervals) {
const [ prevStart, prevEnd ] = prev;
const [ currStart, currEnd ] = curr;

if (prev[1] >= intervals[i][0]) {
prev[1] = Math.max(prev[1], intervals[i][1]);
} else {
res.push(intervals[i]);
const hasOverlap = currStart <= prevEnd;
if (hasOverlap) {
prev[1] = Math.max(prev[1], curr[1]);
continue;
}

merged.push(prev);
prev = curr;
}
return res;
};

return [ ...merged, prev ];
}
65 changes: 41 additions & 24 deletionsjavascript/57-Insert-Interval.js
View file
Open in desktop
Original file line numberDiff line numberDiff line change
@@ -1,26 +1,43 @@
let insert = function (intervals, newInterval) {
let res = [];
let isAdded = false;

intervals.forEach((int) => {
if (int[0] > newInterval[1]) {
if (!isAdded) {
res.push(newInterval);
isAdded = true;
}

res.push(int);
} else if (int[1] < newInterval[0]) {
res.push(int);
} else {
newInterval[0] = Math.min(newInterval[0], int[0]);
newInterval[1] = Math.max(newInterval[1], int[1]);
}
});

if (!isAdded) {
res.push(newInterval);
}
/**
* https://leetcode.com/problems/insert-interval/
* Time O(N) | Space O(N)
* @param {number[][]} intervals
* @param {number[]} newInterval
* @return {number[][]}
*/
var insert = function(intervals, newInterval) {
const { beforeIndex, before } = getBefore(intervals, newInterval);
const afterIndex = mergeIntervals(intervals, newInterval, beforeIndex);
const after = intervals.slice(afterIndex);

returnres;
return[ ...before, newInterval, ...after ];
};

const getBefore = (intervals, newInterval, index = 0, before = []) => {
const hasGap = ([ prevStart, prevEnd ], [ currStart, currEnd ]) =>
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others.Learn more.

same as others

Copy link
CollaboratorAuthor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others.Learn more.

@mitchellirvin
Since this in a while loop, we can either leave as is

consthasOverlap=()=> ...while(hasOverlap())

Move out of scoop

consthasOverlap=()=> ...constloop=()=>{while(hasOverlap())}

or add inline with comment

// hasOverlap = intervals[index] <= newInterval[1]while(intervals[index]<=newInterval[1])

prevEnd < currStart;

while (index < intervals.length && hasGap(intervals[index], newInterval)) {
const current = intervals[index];

before.push(current);
index++;
}

return { beforeIndex: index, before };
}

const mergeIntervals = (intervals, newInterval, index) => {
const hasOverlap = ([ prevStart, prevEnd ], [ currStart, currEnd ]) =>
currStart <= prevEnd;

while (index < intervals.length && hasOverlap(newInterval, intervals[index])) {
const current = intervals[index];

newInterval[0] = Math.min(newInterval[0], current[0]);
newInterval[1] = Math.max(newInterval[1], current[1]);
index++;
}

return index;
}
[8]ページ先頭
©2009-2025 Movatter.jp