Skip to content

Instantly share code, notes, and snippets.

View yungyungGwon's full-sized avatar

권윤경(Frontend) yungyungGwon

View GitHub Profile
function solution(s){
var answer = 0;
var cnt = 0, check1 = "", check2 = "";
var length = [];
for(var i = 1; i < s.length; i++){
var strCh = "";
for(var j = 0; j < s.length;){
check1 = s.substr(j,i);
check2 = s.substr(j + i, i);
@yungyungGwon
yungyungGwon / Printer.js
Created August 22, 2020 11:18
Algorithm
function solution(priorities, location){
var answer = 1;
var first = -1;
var requestIdx = location;
while(priorities.length > 0){
first = priorities.shift();
if(priorities.some((value, index) => value > first)){
priorities.push(first);
function solution(skill, skill_trees){
var answer = 0;
var compare1 = "", compare2 = "";
for(var i = 0; i < skill_trees.length; i++){
var startIndex = 0;
var flag = true;
for(var j = 0; j < skill_trees[i].length; j++){
for(var idx = startIndex; idx < skill.length; idx++){
function solution(progresses, speeds){
var answer = [];
var check = [];
var bound, rest, day, temp = 0;
for(var i = 0; i < progresses.length; i++){
rest = 100 - progresses[i];
if(rest % speeds[i] == 0){
day = rest / speeds[i];
}
@yungyungGwon
yungyungGwon / X_Size.js
Created August 21, 2020 09:04
Algorithm
function solution(x, n){
var answer = [];
var value = x;
for(var i = 0; i < n; i++){
answer[i] = value;
value += x;
}
return answer;
}
@yungyungGwon
yungyungGwon / Max_Min.js
Last active August 21, 2020 08:32
Algorithm
function solution(n, m){
var answer = [];
answer[0] = solution2(n,m);
answer [1] = n * m / answer[0];
return answer;
}
function solution2(n,m){
var min = 0;
@yungyungGwon
yungyungGwon / Desc.js
Last active August 21, 2020 08:33
Algorithm
function solution(n){
var answer = 0;
answer = parseInt(String(n).split('').sort().reverse().join(''));
return answer;
}
@yungyungGwon
yungyungGwon / CaesarCode.js
Last active August 21, 2020 08:36
Algorithm
function solution(s,n){
var answer = "";
var check = "";
for(var i = 0; i < s.length; i++){
check = s.charCodeAt(i);
if(check == 32){
answer += " ";
}
else if (check >= 65 && check <= 90){
if(check + n > 90){
@yungyungGwon
yungyungGwon / Row_Column.js
Last active August 21, 2020 08:36
Algorithm
function solution(arr1, arr2){
var answer = [];
for(var k = 0; k < arr1.length; k++){
answer.push([]);
}
for(var i = 0; i < arr1.length; i++){
for(var j = 0; j < arr1[i].length; j++){
answer[i][j] = arr1[i][j] + arr2[i][j];
}
}
@yungyungGwon
yungyungGwon / Min_Delete.js
Last active August 21, 2020 08:35
Algorithm
function solution(arr){
var min = arr[0];
var idx = 0;
for(var i = 1; i < arr.length; i++){
if(min > arr[i]){
min = arr[i];
idx = i;
}
}
arr.splice(idx,1);