palindrome number better approach with maths 0(log(n)100)

Author: Gabrieldev-web-coder

leetcode/PalindromeNumber.js

@@ -1,5 +1,14 @@
 function isPalindrome(x) {
-  const s = Number(String(x).split("").reverse().join(""));
-  return x === s;
+  if (x < 0 || (x !== 0 && x % 10 == 0)) return false;
+
+  let reverse = 0;
+
+  while (x > reverse) {
+    reverse = reverse * 10 + (x % 10);
+    x = ~~(x / 10);
+  }
+
+  return x === reverse || x === ~~(reverse / 10);
 }
-//My first iteration over Palindrome number, quadratic time complexity 0(n2)
+//Better approach without convert integer in string and in array, just working with integer number finding the half integer and compare it with original
+//0(logn100)