feat: update solutions to leetcode problem

Author: yanglbme

lcof/面试题67. 把字符串转换成整数/README.md

@@ -68,6 +68,8 @@
 
 遍历字符串，注意做溢出处理。
 
+同[字符串转换整数 (atoi)](/solution/0000-0099/0008.String%20to%20Integer%20%28atoi%29/README.md)。
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -85,16 +87,19 @@ class Solution:
         i = 0
         while str[i] == ' ':
             i += 1
+            # 仅包含空格
             if i == n:
                 return 0
         sign = -1 if str[i] == '-' else 1
         if str[i] in ['-', '+']:
             i += 1
         res, flag = 0, (2 ** 31 - 1) // 10
         while i < n:
+            # 非数字，跳出循环体
             if not str[i].isdigit():
                 break
             c = int(str[i])
+            # 溢出判断
             if res > flag or (res == flag and c > 7):
                 return 2 ** 31 - 1 if sign > 0 else -2 ** 31
             res = res * 10 + c
@@ -122,7 +127,7 @@ class Solution {
         if (str.charAt(i) == '-' || str.charAt(i) == '+') ++i;
         int res = 0, flag = Integer.MAX_VALUE / 10;
         for (; i < n; ++i) {
-            // 非数字
+            // 非数字，跳出循环体
             if (str.charAt(i) < '0' || str.charAt(i) > '9') break;
             // 溢出判断
             if (res > flag || (res == flag) && str.charAt(i) > '7') return sign > 0 ? Integer.MAX_VALUE : Integer.MIN_VALUE;

lcof/面试题67. 把字符串转换成整数/Solution.py

@@ -8,16 +8,19 @@ def strToInt(self, str: str) -> int:
         i = 0
         while str[i] == ' ':
             i += 1
+            # 仅包含空格
             if i == n:
                 return 0
         sign = -1 if str[i] == '-' else 1
         if str[i] in ['-', '+']:
             i += 1
         res, flag = 0, (2 ** 31 - 1) // 10
         while i < n:
+            # 非数字，跳出循环
             if not str[i].isdigit():
                 break
             c = int(str[i])
+            # 溢出判断
             if res > flag or (res == flag and c > 7):
                 return 2 ** 31 - 1 if sign > 0 else -2 ** 31
             res = res * 10 + c

solution/0000-0099/0008.String to Integer (atoi)/README.md

@@ -61,7 +61,9 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-同[面试题 67. 把字符串转换成整数](/lcof/面试题67.%20把字符串转换成整数/README.md)
+遍历字符串，注意做溢出处理。
+
+同[面试题 67. 把字符串转换成整数](/lcof/面试题67.%20把字符串转换成整数/README.md)。
 
 <!-- tabs:start -->
 
@@ -80,16 +82,19 @@ class Solution:
         i = 0
         while s[i] == ' ':
             i += 1
+            # 仅包含空格
             if i == n:
                 return 0
         sign = -1 if s[i] == '-' else 1
         if s[i] in ['-', '+']:
             i += 1
         res, flag = 0, (2 ** 31 - 1) // 10
         while i < n:
+            # 非数字，跳出循环体
             if not s[i].isdigit():
                 break
             c = int(s[i])
+            # 溢出判断
             if res > flag or (res == flag and c > 7):
                 return 2 ** 31 - 1 if sign > 0 else -2 ** 31
             res = res * 10 + c
@@ -117,7 +122,7 @@ class Solution {
         if (s.charAt(i) == '-' || s.charAt(i) == '+') ++i;
         int res = 0, flag = Integer.MAX_VALUE / 10;
         for (; i < n; ++i) {
-            // 非数字
+            // 非数字，跳出循环体
             if (s.charAt(i) < '0' || s.charAt(i) > '9') break;
             // 溢出判断
             if (res > flag || (res == flag && s.charAt(i) > '7')) return sign > 0 ? Integer.MAX_VALUE : Integer.MIN_VALUE;

solution/0000-0099/0008.String to Integer (atoi)/README_EN.md

@@ -98,16 +98,19 @@ class Solution:
         i = 0
         while s[i] == ' ':
             i += 1
+            # only contains blank space
             if i == n:
                 return 0
         sign = -1 if s[i] == '-' else 1
         if s[i] in ['-', '+']:
             i += 1
         res, flag = 0, (2 ** 31 - 1) // 10
         while i < n:
+            # not a number, exit the loop
             if not s[i].isdigit():
                 break
             c = int(s[i])
+            # if overflows
             if res > flag or (res == flag and c > 7):
                 return 2 ** 31 - 1 if sign > 0 else -2 ** 31
             res = res * 10 + c
@@ -133,7 +136,7 @@ class Solution {
         if (s.charAt(i) == '-' || s.charAt(i) == '+') ++i;
         int res = 0, flag = Integer.MAX_VALUE / 10;
         for (; i < n; ++i) {
-            // not number
+            // not a number, exit the loop
             if (s.charAt(i) < '0' || s.charAt(i) > '9') break;
             // if overflows
             if (res > flag || (res == flag && s.charAt(i) > '7')) return sign > 0 ? Integer.MAX_VALUE : Integer.MIN_VALUE;

solution/0000-0099/0008.String to Integer (atoi)/Solution.py

@@ -8,16 +8,19 @@ def myAtoi(self, s: str) -> int:
         i = 0
         while s[i] == ' ':
             i += 1
+            # only contains blank space
             if i == n:
                 return 0
         sign = -1 if s[i] == '-' else 1
         if s[i] in ['-', '+']:
             i += 1
         res, flag = 0, (2 ** 31 - 1) // 10
         while i < n:
+            # not a number, exit the loop
             if not s[i].isdigit():
                 break
             c = int(s[i])
+            # if overflows
             if res > flag or (res == flag and c > 7):
                 return 2 ** 31 - 1 if sign > 0 else -2 ** 31
             res = res * 10 + c