Skip to content
Navigation Menu
Sign in
Appearance settings
Platform
AI CODE CREATION
GitHub Copilot
Write better code with AI
GitHub Copilot app
Direct agents from issue to merge
MCP Registry
Integrate external tools
DEVELOPER WORKFLOWS
Actions
Automate any workflow
Codespaces
Instant dev environments
Issues
Plan and track work
Code Review
Manage code changes
Code Quality
Enforce quality at merge
APPLICATION SECURITY
GitHub Advanced Security
Find and fix vulnerabilities
Code security
Secure your code as you build
Secret protection
Stop leaks before they start
EXPLORE
Why GitHub
Documentation
Blog
Changelog
Marketplace
View all features
Solutions
BY COMPANY SIZE
Enterprises
Small and medium teams
Startups
Nonprofits
BY USE CASE
App Modernization
DevSecOps
DevOps
CI/CD
View all use cases
BY INDUSTRY
Healthcare
Financial services
Manufacturing
Government
View all industries
View all solutions
Resources
EXPLORE BY TOPIC
AI
Software Development
DevOps
Security
View all topics
EXPLORE BY TYPE
Customer stories
Events & webinars
Ebooks & reports
Business insights
GitHub Skills
SUPPORT & SERVICES
Documentation
Customer support
Community forum
Trust center
Partners
View all resources
Open Source
COMMUNITY
GitHub Sponsors
Fund open source developers
PROGRAMS
Security Lab
Maintainer Community
GitHub Stars
Archive Program
REPOSITORIES
Topics
Trending
Collections
Enterprise
ENTERPRISE SOLUTIONS
Enterprise platform
AI-powered developer platform
AVAILABLE ADD-ONS
GitHub Advanced Security
Enterprise-grade security features
Copilot for Business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
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 }}
gwonkim
Study_Algorithm
Repository navigation
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
main
Breadcrumbs
Study_Algorithm
/
notCompletion.js
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
45 lines (35 loc) · 1.54 KB
main
Breadcrumbs
Study_Algorithm
/
notCompletion.js
Copy path
Top
File metadata and controls
Code
Blame
45 lines (35 loc) · 1.54 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
/*
<문제>
수많은 마라톤 선수들이 마라톤에 참여하였습니다. 단 한 명의 선수를 제외하고는 모든 선수가 마라톤을 완주하였습니다.
마라톤에 참여한 선수들의 이름이 담긴 배열 participant와 완주한 선수들의 이름이 담긴 배열 completion이 주어질 때, 완주하지 못한 선수의 이름을 return 하도록 solution 함수를 작성해주세요.
----------
성능으로는 for문이 더 좋다
filter, map, forEach는 O(n)의 시간복잡도를 갖지만 2중일 경우 O(n^2)
forEach Vs for문 시간 차이는 일반적으로 for문이 약 1.4배 빠름(성능 : for문이 좋음)
*/
// 정확성O 효율성 X
// 효율성 테스트 : 시간 초과
function solution1(participant, completion) {
completion.filter(c => {
let i = participant.findIndex(p => c === p);
participant.splice(i, 1);
})
return participant[0];
}
// 정확성O 효율성 O
// 속도로는 for문이 효율적
function solution2(participant, completion) {
participant.sort();
completion.sort();
for(var i=0;i<participant.length;i++) {
if(participant[i] !== completion[i]) return participant[i];
}
}
let a = ["leo", "kiki", "eden"];
let b = ["eden", "kiki"]; // "leo"
let c = ["marina", "josipa", "nikola", "vinko", "filipa"];
let d = ["josipa", "filipa", "marina", "nikola"]; // "vinko"
console.log('solution1', solution1(a, b));
console.log('solution1', solution1(c, d));
console.log('solution2', solution2(a, b));
console.log('solution2', solution2(c, d));
You can’t perform that action at this time.