Fixed description 29.

src/main/java/g0001_0100/s0029_divide_two_integers/readme.md

@@ -8,7 +8,7 @@ The integer division should truncate toward zero, which means losing its fractio
 
 Return _the **quotient** after dividing_ `dividend` _by_ `divisor`.
 
-**Note:** Assume we are dealing with an environment that could only store integers within the **32-bit** signed integer range: <code>[−2<sup>31</sup>, 2<sup>31</sup> − 1]</code>. For this problem, if the quotient is **strictly greater than** `231 - 1`, then return `231 - 1`, and if the quotient is **strictly less than** `-231`, then return `-231`.
+**Note:** Assume we are dealing with an environment that could only store integers within the **32-bit** signed integer range: <code>[−2<sup>31</sup>, 2<sup>31</sup> − 1]</code>. For this problem, if the quotient is **strictly greater than** <code>[2<sup>31</sup> − 1]</code>, then return <code>[2<sup>31</sup> − 1]</code>, and if the quotient is **strictly less than** <code>[-2<sup>31</sup> − 1]</code>, then return <code>[-2<sup>31</sup> − 1]</code>.
 
 **Example 1:**