Skip to content
Navigation Menu
Sign in
Products
Platform
GitHub
Repository hosting, code review, and collaboration
Copilot
AI coding agent for tasks, projects, and automated work
Build & Ship
Actions
CI/CD and automation
Code Quality
Quality analysis, fixes, and enforcement
Codespaces
Cloud development environments
Secure
Code Security
Vulnerability detection and remediation
Secret Protection
Secret scanning and leak prevention
All Features
Developers
Learn
Documentation
Training
Certifications
Build
Build with Copilot
Customize Copilot
Integrations
Explore
Trending repos
GitHub Sponsors
Developer articles
Changelog
Changelog
Your source for the latest features, improvements, and fixes across GitHub products, all in one place.
Businesses
By Stage
Enterprises
Team
Startups
Nonprofits
By Industry
Healthcare
Financial services
Manufacturing
Government
See all industries
Evaluate GitHub
Why GitHub
Customer Stories
Business insights
Trust Center
Add-ons
GitHub Advanced Security
Enterprise-grade code security
Copilot for business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Resources
Learn & Connect
Documentation
Resource center
Blog
Events & webinars
Community Forum
Customer Stories
Integrations
Support
Customer support
Training
GitHub Status
Company
About
Partners
Changelog
GitHub Universe
GitHub Universe
The event for developers, by developers — talks, workshops, and what’s next for GitHub.
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
SaaaHoP
algorithm-js
Repository navigation
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
main
Breadcrumbs
algorithm-js
/
mridiLiveTest.js
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
54 lines (44 loc) · 1.46 KB
main
Breadcrumbs
algorithm-js
/
mridiLiveTest.js
Copy path
Top
File metadata and controls
Code
Blame
54 lines (44 loc) · 1.46 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
/*
interval[i] = [starti, endi] 인 간격의 배열이 주어지면
겹치는 모든 간격을 병합하고 입력의 모든 간격을 포함하는 겹치지 않는 간격의 배열을 반환합니다.
input : [[1,3],[2,6],[8,10],[15,18]]
output: [[1,6],[8,10],[15,18]]
input: [[1,3], [2,6], [4,10], [15,18]]
output: []
input : [[1,4],[4,5]]
output: [[1,5]]
input : [[2, 4], [1, 3]]
output : [[1, 4]]
*/
/**
* @param {number[][]} intervals
* @return {number[][]}
*/
// 순서가 꼭 다음이 큰게 올거라는 보장이 없는데 왜 그렇게 생각했을까? -> 작은순서대로 먼저 정렬해줘야 한다.
// 겹치는 구간이 있으면, 두개의 좌표를 비교해서 가장 작은값과 가장 큰 값으로 좌표를 넣어주면 된다.
const merge = function (intervals) {
const sortedIntervals = intervals.sort((a, b) => {
if (a[0] > b[0]) return 1;
if (a[0] < b[0]) return -1;
if (a[0] === b[0]) return 0;
});
const answer = [[...sortedIntervals[0]]];
for (let i = 1; i < sortedIntervals.length; i++) {
if (answer[answer.length - 1][1] >= sortedIntervals[i][0]) {
const tempArr = [...answer[answer.length - 1], ...sortedIntervals[i]];
const minValue = Math.min(...tempArr);
const maxValue = Math.max(...tempArr);
answer.pop();
answer.push([minValue, maxValue]);
continue;
}
answer.push(sortedIntervals[i]);
}
return answer;
};
console.log(
merge([
[1, 4],
[4, 5],
])
);
You can’t perform that action at this time.