This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
🌞 Morning 109 commits █████▋░░░░░░░░░░░░░░░ 27.3% | |
🌆 Daytime 55 commits ██▉░░░░░░░░░░░░░░░░░░ 13.8% | |
🌃 Evening 87 commits ████▌░░░░░░░░░░░░░░░░ 21.8% | |
🌙 Night 148 commits ███████▊░░░░░░░░░░░░░ 37.1% |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
export default (function(){ | |
let instance = null; | |
/** | |
* Create a new Router. | |
* @class | |
* @param {HTMLElement} root | |
* @param {object} [options] | |
*/ | |
function Router(root, options){ | |
if(!(root instanceof HTMLElement)){ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
//동기 방식으로 작동하는 코드 | |
function loop() { | |
//for문을 실행하기 전 | |
const start = Date.now(); | |
//i가 9999999가 될 때 까지 ++ | |
for (let i = 0; i <= 9999999; i++) {} | |
const end = Date.now(); | |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function solution(sample) { | |
let scores = []; | |
let grades = ""; | |
const S_LENGTH = sample.length; | |
function calc(index, score){ | |
const MAX = Math.max(...score); | |
const MIN = Math.min(...score); | |
const SELF = score[index]; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function solution(table, languages, preference) { | |
const FIELD = ["SI", "CONTENTS", "HARDWARE", "PORTAL", "GAME"]; | |
const separate = []; | |
const count = []; | |
let answer = []; | |
for(let i of table){ | |
let temp = i.split(' '); | |
separate.push(temp.slice(1)); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// solution 1 | |
function solution(answers) { | |
const submit = ["12345", "21232425", "3311224455"]; | |
function cnt(submit) { | |
const A_LENGTH = answers.length; | |
const S_LENGTH = submit.length; | |
if(A_LENGTH > S_LENGTH){ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<!DOCTYPE html> | |
<html> | |
<head> | |
<meta charset="UTF-8"> | |
<title>Document</title> | |
</head> | |
<body> | |
<ul> | |
<li>apple</li> | |
<li>orange</li> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
//solution 01 | |
function solution(n) { | |
function cnt(number) { | |
return number.toString(2) | |
.match(/1/g) | |
.length; | |
} | |
const n_cnt = cnt(n); | |
let start = n; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function solution(progresses, speeds) { | |
let answer = progresses.map((el, index) => Math.ceil((100 - el) / speeds[index])); | |
const LENGTH = answer.length; | |
let temp = []; | |
let cnt = 1; | |
let max = answer[0]; | |
for(let i = 1; i < LENGTH; i++){ | |
if(max >= answer[i]){ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function solution(s) { | |
s = s.split(' ').sort((a,b) => a-b); | |
let answer = [(s[0]), s[s.length-1]]; | |
return answer.join(' '); | |
} |
NewerOlder