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
/
countryOfNumber.js
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
39 lines (32 loc) · 1.15 KB
main
Breadcrumbs
Study_Algorithm
/
countryOfNumber.js
Copy path
Top
File metadata and controls
Code
Blame
39 lines (32 loc) · 1.15 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
// 124 나라의 숫자
// 1, 2, 4 3진법 문제(like 2진법)
// 각 숫자를 3으로 나눈 나머지와 나누기를 이용하는 방법으로 접근
// num = [1, 2, 4]
// 예시 4: 4/3 = 1, 4%3 = 1, => num[1-1] num[1-1] == 11
// 예시 10: 10/3 = 3, 10%3 = 1 => num[3-1] num[1-1] == 41
/*
Math.ceil을 사용하여 계산해서 헤맴
124의 순서가 포인트!
- 처음에는 배열에 담아 [1, 2, 4] 순서로 하고 -1을 통해 값을 대입했지만
여러 번의 계산을 통해 나머지가 0, 1, 2일 때 4, 1, 2값이 동일하게 나온다는 것을 파악
[방법]
뒷 숫자부터 계산
그리고 n을 나머지가 0이기 전까지
n = n/3을 하면서 반복
n 나머지값이 0이 나오는 순간 n의 3 나눈 값(1)에서 -1을 통해 0으로 만들어 반복문 종료
*/
function solution(n) {
let num = [4, 1, 2];
let answer = '';
while(n) {
answer = num[n%3] + answer;
n = n%3 == 0 ? n/3-1 : Math.floor(n/3);
}
return answer;
}
let n1 = 5; // 12
let n2 = 10; // 41
let n3 = 6; // 12
console.log(n1, ' => ', solution(n1));
console.log(n2, ' => ', solution(n2));
console.log(n3, ' => ', solution(n3));
You can’t perform that action at this time.