Refactor 1.6 solution to address for-if antipattern and unnecessary var keywords

Author: rroque98

JavaScript/chapter01/1.6 - String Compression/rroque98_sol.js

@@ -1,4 +1,4 @@
-/* Implement a method to perform basic string 
+/* Implement a method to perform basic string
 compression using the counts of repeated characters.
 If the compressed string length is more than original
 string length, return original string.
@@ -9,22 +9,20 @@ const stringCompression = (str) => {
   if (!str.length) {
     return '';
   }
-  var compStr = '';
-  var count = 0;
-  var currentChar = str[0];
+  let compStr = '';
+  let count = 0;
+  let currentChar = str[0];
   for (let i = 0; i < str.length; i++) {
     let char = str[i];
     if (char === currentChar) {
       count++;
-      if (i === str.length - 1) {
-        compStr += `${currentChar}${count}`;
-      }
     } else {
       compStr += `${currentChar}${count}`;
       currentChar = char;
       count = 1;
     }
   }
+  compStr += `${currentChar}${count}`;
   if (compStr.length > str.length) {
     return str;
   }
@@ -35,6 +33,6 @@ const stringCompression = (str) => {
 console.log(stringCompression('aabcccccaaa') === 'a2b1c5a3');
 console.log(stringCompression('cccccccc') === 'c8');
 console.log(stringCompression('') === '');
-console.log(stringCompression('AabccCccaaa') === 'AabccCccaaa'); 
+console.log(stringCompression('AabccCccaaa') === 'AabccCccaaa');
 // Explanation: 'A1a1b1c2C1c2a3' length is longer than original string so returns original string
 console.log(stringCompression('x') === 'x');