본문 바로가기
CS (컴퓨터 사이언스)/Algorithm (알고리즘)

[알고리즘] 3.연필개수 / 4. 1부터 N까지의 합 / 6.홀수 / 7 . 10부제

by dreamer10457 2023. 12. 9.
반응형

3. 연필개수

<html>
  <head>
    <meta charset="UTF-8" />
    <title>출력결과</title>
  </head>
  <body>
    <script>
      function solution(n) {
        return Math.ceil(n / 12);
        // if (n % 12 > 0) {
        //   return parseInt(n / 12) + 1;
        // } else {
        //   return parseInt(n / 12);
        // }
      }

      console.log(solution(25));
    </script>
  </body>
</html>

 

4. 1부터 N까지의 합

<html>
  <head>
    <meta charset="UTF-8" />
    <title>출력결과</title>
  </head>
  <body>
    <script>
      function solution(n) {
        let answer = 0;

        for (let i = 1; i <= n; i++) {
          answer = answer + i;
        }

        return answer;
      }

      console.log(solution(6));
    </script>
  </body>
</html>

 

6. 홀수

<html>
  <head>
    <meta charset="UTF-8" />
    <title>출력결과</title>
  </head>
  <body>
    <script>
      function solution(arr) {
        let answer = [];
        let sum = 0;
        let min = Number.MAX_SAFE_INTEGER;

        arr.forEach((num) => {
          if (num % 2 !== 0) {
            sum = sum + num;
            if (min > num) {
              min = num;
            }
          }
        });

        answer.push(sum);
        answer.push(min);
        return answer;
      }

      arr = [12, 77, 38, 41, 53, 92, 85];
      console.log(solution(arr));
    </script>
  </body>
</html>

 

7. 10부제

<html>
  <head>
    <meta charset="UTF-8" />
    <title>출력결과</title>
  </head>
  <body>
    <script>
      function solution(day, arr) {
        let number = 0;

        arr.forEach((car) => {
          if (day == String(car)[1]) {
            number++;
          }
        });
        return number;
      }

      arr = [25, 23, 11, 47, 53, 17, 33];
      console.log(solution(3, arr));
    </script>
  </body>
</html>
반응형