[LeetCode Sync] Runtime - 0 ms (100.00%), Memory - 17.6 MB (96.27%)

Author: NinePiece2

Solutions/0367-valid-perfect-square/README.md

@@ -0,0 +1,29 @@
+<p>Given a positive integer num, return <code>true</code> <em>if</em> <code>num</code> <em>is a perfect square or</em> <code>false</code> <em>otherwise</em>.</p>
+
+<p>A <strong>perfect square</strong> is an integer that is the square of an integer. In other words, it is the product of some integer with itself.</p>
+
+<p>You must not use any built-in library function, such as <code>sqrt</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> num = 16
+<strong>Output:</strong> true
+<strong>Explanation:</strong> We return true because 4 * 4 = 16 and 4 is an integer.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> num = 14
+<strong>Output:</strong> false
+<strong>Explanation:</strong> We return false because 3.742 * 3.742 = 14 and 3.742 is not an integer.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= num &lt;= 2<sup>31</sup> - 1</code></li>
+</ul>

Solutions/0367-valid-perfect-square/solution.py

@@ -0,0 +1,19 @@
+class Solution:
+    def isPerfectSquare(self, num: int) -> bool:
+        # left = bisect_left(range(1, num + 1), num, key=lambda x: x * x) + 1
+        # return left * left == num
+
+        left = 0
+        right = num
+
+        while left <= right:
+            mid = (left + right) // 2
+            temp = mid * mid
+            if num == temp:
+                return True
+            elif temp < num:
+                left = mid + 1
+            else:
+                right = mid - 1
+        
+        return False