Merge pull request #22 from yongchanson/main

[2022.04.07] 3문제 솔루션추가

Author: codeisneverodd

level-1/문자열-내-p와-y의-개수.js

@@ -8,4 +8,12 @@ function solution(s) {
  if (countP !== countY) answer = false
 
  return answer;
-}
+}
+
+//정답 2 - yongchanson
+function solution(s) {
+ p = s.toLowerCase().split("p").length;
+ y = s.toLowerCase().split("y").length;
+
+ return p == y ? true : false;
+}

level-1/문자열-다루기-기본.js

@@ -6,4 +6,16 @@ function solution(s) {
  const length = s.length
  if (s.search(/\D/g) < 0 && (length === 4 || length === 6)) answer = true
  return answer;
-}
+}
+
+//정답 2 - yongchanson
+function solution(s) {
+ let parseInts = parseInt(s);
+ if (s.length == 6 || s.length == 4) {
+ if (s == parseInts) {
+ return true;
+ }
+ }
+
+ return false;
+}

level-1/약수의-합.js

@@ -5,4 +5,23 @@ function solution(n) {
  var answer = 0;
  for (let divisor = 1; divisor <= n; divisor++) if (n % divisor === 0) answer += divisor
  return answer;
-}
+}
+
+//정답 2 - yongchanson
+function solution(n) {
+ var answer = 0;
+ let i;
+ for (i = 1; i <= Math.sqrt(n); i++) {
+ if (n % i == 0) {
+ if (i * i == n) {
+ //i의 제곱이 n인경우 처리
+ answer += i;
+ } else {
+ answer += i;
+ answer += n / i;
+ }
+ }
+ }
+
+ return answer;
+}