✨ [q7] Runtime 62 ms Beats 90.96% Memory 43.9 MB Beats 57.6%

Author: enkr1

7/my_solution.js

@@ -3,30 +3,24 @@
  * @return {number}
  */
 const reverse = (x) => {
-  let charList = x.toString().split(''), result = null;
   console.log(x);
-  // console.log(x >>> 0);
-  console.log((2 ** 31) - 1);
-
-  result = reverseCharList(charList, 0, 1, null, false);
-
-  console.log("result")
-  console.log(result)
+  return (x < 0) ? reverseCharList((-x).toString().split(''), 0, 1, null) * -1 : reverseCharList(x.toString().split(''), 0, 1, null);
 };
 
-const reverseCharList = (charList, i, factor, result, isNeg) => {
+const reverseCharList = (charList, i, factor, result) => {
+  if ((2 ** 31) <= result) return 0;
   if (undefined === charList[i]) {
-    if ((2 ** 31) <= result) return 0;
-
-    return isNeg ? result * -1 : result;
+    console.log("Returning: " + result)
+    return result;
   }
+
   console.log("charList[i]")
   console.log(charList[i])
-  if ("-" === charList[i]) {
-    isNeg = true;
-    i++;
-    return reverseCharList(charList, i, factor, result, isNeg);
-  }
+  // if ("-" === charList[i]) {
+  //   isNeg = true;
+  //   i++;
+  //   return reverseCharList(charList, i, factor, result, isNeg);
+  // }
 
   result += (parseInt(charList[i]) * factor);
   factor *= 10;
@@ -36,11 +30,11 @@ const reverseCharList = (charList, i, factor, result, isNeg) => {
   console.log(factor)
 
   i++;
-  return reverseCharList(charList, i, factor, result, isNeg);
+  return reverseCharList(charList, i, factor, result);
 }
 
 
 // reverse(321)
 // reverse(120)
-// reverse(-123)
-reverse(1534236469)
+reverse(-123)
+// reverse(1534236469)

7/solution.js

@@ -3,24 +3,17 @@
  * @return {number}
  */
 const reverse = (x) => {
-  return reverseCharList(x.toString().split(''), 0, 1, null, false);
+  return (x < 0) ? reverseCharList((-x).toString().split(''), 0, 1, null) * -1 : reverseCharList(x.toString().split(''), 0, 1, null);
 };
 
-const reverseCharList = (charList, i, factor, result, isNeg) => {
-  if (undefined === charList[i]) {
-    if ((2 ** 31) <= result) return 0;
-    return isNeg ? result * -1 : result;
-  }
-
-  if ("-" === charList[i]) {
-    isNeg = true;
-    i++;
-    return reverseCharList(charList, i, factor, result, isNeg);
-  }
+const reverseCharList = (charList, i, factor, result) => {
+  if ((2 ** 31) <= result) return 0;
+  if (undefined === charList[i]) return result;
 
   result += (parseInt(charList[i]) * factor);
   factor *= 10;
   i++;
 
-  return reverseCharList(charList, i, factor, result, isNeg);
+  return reverseCharList(charList, i, factor, result);
 }
+