Revert "리뷰 해주신 부분 변수명이 겹쳐서 그 부분만 수정하였습니다 바로 머지하겠습니다"

Author: jeongshin

codility_training/lessons.lesson10.PrimeAndCompositeNumbers.Flags/eyabc.js

@@ -52,7 +52,7 @@ const next_peak = A => {
 function solution(A) {
   const N = A.length;
   const next = next_peak(A);
-  let i = 1, jumps = 0;
+  let i = 1, result = 0;
   while((i - 1) * i <= N) {
     let pos = 0, num = 0;
     while (pos < N && num < i) {
@@ -62,10 +62,10 @@ function solution(A) {
       num += 1;
       pos += i;
     }
-    jumps = Math.max(jumps, num);
+    result = Math.max(result, num);
     i += 1
   }
-  return jumps
+  return result
 }
 
 console.log(

codility_training/lessons.lesson13.FibonacciNumbers.FibFrog/JeongShin.js

@@ -7,22 +7,22 @@ function solution(A) {
         idx++;
     }
     const stack = [new frog(-1, 0)];
-    const jumps = [];    // 최소 점프수만 index 별로 저장하는 배열
+    const count = [];    // 최소 점프수만 index 별로 저장하는 배열
     A[len] = 1;
     while (stack[0] !== undefined) {
-        const {pos, count} = stack.pop();
+        const { pos, count } = stack.pop();
         for (const jump of fib) {
-            const next_pos = pos + jump;
-            if (A[next_pos] === 1) {
-                const next_count = jumps[next_pos] || Infinity;
+            const next = pos + jump;
+            if (A[next] === 1) {
+                const next_count = count[next] || Infinity;
                 if (next_count > (count + 1)) {
-                    stack.push(new frog(next_pos, count + 1));
-                    jumps[next_pos] = count + 1;
+                    stack.push(new frog(next, count + 1));
+                    count[next] = count + 1;
                 }
             }
         }
     }
-    return jumps[len] || -1;
+    return count[len] || -1;
 }
 
 class frog {
@@ -32,6 +32,4 @@ class frog {
     }
 }
 
-const r = solution([1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1])
-console.log(r)
-
+solution([1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1])