Sync LeetCode submission Runtime - 4 ms (16.12%), Memory - 17.9 MB (18.55%)

Author: jimit105

0008-string-to-integer-atoi/README.md

@@ -4,7 +4,7 @@
 
 <ol>
 	<li><strong>Whitespace</strong>: Ignore any leading whitespace (<code>&quot; &quot;</code>).</li>
-	<li><strong>Signedness</strong>: Determine the sign by checking if the next character is <code>&#39;-&#39;</code> or <code>&#39;+&#39;</code>, assuming positivity is neither present.</li>
+	<li><strong>Signedness</strong>: Determine the sign by checking if the next character is <code>&#39;-&#39;</code> or <code>&#39;+&#39;</code>, assuming positivity if neither present.</li>
 	<li><strong>Conversion</strong>: Read the integer by skipping leading zeros&nbsp;until a non-digit character is encountered or the end of the string is reached. If no digits were read, then the result is 0.</li>
 	<li><strong>Rounding</strong>: If the integer is out of the 32-bit signed integer range <code>[-2<sup>31</sup>, 2<sup>31</sup> - 1]</code>, then round the integer to remain in the range. Specifically, integers less than <code>-2<sup>31</sup></code> should be rounded to <code>-2<sup>31</sup></code>, and integers greater than <code>2<sup>31</sup> - 1</code> should be rounded to <code>2<sup>31</sup> - 1</code>.</li>
 </ol>

0008-string-to-integer-atoi/solution.py

@@ -1,28 +1,35 @@
-# Time: O(N)
+# Time: O(n)
+# Space: O(n)
 
 class Solution:
     def myAtoi(self, s: str) -> int:
         sign, result = 1, 0
+
+        # Whitespace
         s = s.lstrip()
-        
+
         if not s:
             return 0
-        
+
         idx = 0
-        
+
+        # Signedness
         if s[idx] == '-':
             sign = -1
             idx += 1
         elif s[idx] == '+':
             idx += 1
-            
+
+        # Conversion
         int_str = ''
         for i in range(idx, len(s)):
             if s[i].isdigit():
                 int_str += s[i]
             else:
                 break
-                
+
         result = sign * int(int_str) if int_str else 0
-        
-        return max(min(result, 2**31 - 1), -1 * 2**31)
+
+        # Rounding
+        return max(min(result, 2 ** 31 - 1), -1 * 2 ** 31)
+