国外版

算法题（国外版）/minimum-insertion-steps-to-make-a-string-palindrome.html

@@ -0,0 +1,38 @@
+<p>Given a string <code>s</code>. In one step you can insert any character at any index of the string.</p>
+
+<p>Return <em>the minimum number of steps</em> to make <code>s</code>&nbsp;palindrome.</p>
+
+<p>A&nbsp;<b>Palindrome String</b>&nbsp;is one that reads the same backward as well as forward.</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> s = &quot;zzazz&quot;
+<strong>Output:</strong> 0
+<strong>Explanation:</strong> The string &quot;zzazz&quot; is already palindrome we don&#39;t need any insertions.
+</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> s = &quot;mbadm&quot;
+<strong>Output:</strong> 2
+<strong>Explanation:</strong> String can be &quot;mbdadbm&quot; or &quot;mdbabdm&quot;.
+</pre>
+
+<p><strong>Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> s = &quot;leetcode&quot;
+<strong>Output:</strong> 5
+<strong>Explanation:</strong> Inserting 5 characters the string becomes &quot;leetcodocteel&quot;.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= s.length &lt;= 500</code></li>
+	<li><code>s</code> consists of lowercase English letters.</li>
+</ul>