JavaScript
-
프로그래머스_입문_피자나눠먹기(2)JavaScript/Coding_Problems 2023. 2. 1. 18:36
function lcm(a,b){ if(b === 0) return a; return lcm(b, a % b); } function gcd(a,b){ const lcm_num = lcm(a,b) const gcd_num = (a * b) / lcm_num; return gcd_num; } function solution(n) { var gcd_num; if(n >= 6){ gcd_num = (n % 6) + 1 }else{ gcd_num = gcd(n,6) gcd_num = gcd_num / 6 } return gcd_num }
-
입문 - 연속된 수의 합JavaScript/실습 2023. 1. 31. 19:16
첫번째 시도 function solution(num, total) { let arr = Array() let q; let p; if( total % num === 0){ q = total / num p = total / num }else{ q = Math.floor(total / num) p = Math.floor(total / num) } idx_loc = (num -1) / 2 arr.splice(idx_loc, 1, q) let point = (num -1 ) / 2 let cnt1 = 0; let cnt2 = 0; let before_arr = Array(); let after_arr = Array(); while(cnt1 != point){ before_arr.push(q-1) cnt1 += 1..
-
-
-