Package g0001_0100.s0038_count_and_say
Class Solution
java.lang.Object
g0001_0100.s0038_count_and_say.Solution
38 - Count and Say.<p>Medium</p>
<p>The <strong>count-and-say</strong> sequence is a sequence of digit strings defined by the recursive formula:</p>
<ul>
<li><code>countAndSay(1) = "1"</code></li>
<li><code>countAndSay(n)</code> is the way you would “say” the digit string from <code>countAndSay(n-1)</code>, which is then converted into a different digit string.</li>
</ul>
<p>To determine how you “say” a digit string, split it into the <strong>minimal</strong> number of groups so that each group is a contiguous section all of the <strong>same character.</strong> Then for each group, say the number of characters, then say the character. To convert the saying into a digit string, replace the counts with a number and concatenate every saying.</p>
<p>For example, the saying and conversion for digit string <code>"3322251"</code>:</p>
<p><img src="https://assets.leetcode.com/uploads/2020/10/23/countandsay.jpg" alt="" /></p>
<p>Given a positive integer <code>n</code>, return <em>the</em> <code>nth</code> <em>term of the <strong>count-and-say</strong> sequence</em>.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> n = 1</p>
<p><strong>Output:</strong> “1”</p>
<p><strong>Explanation:</strong> This is the base case.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> n = 4</p>
<p><strong>Output:</strong> “1211”</p>
<p><strong>Explanation:</strong></p>
<pre><code> countAndSay(1) = "1"
countAndSay(2) = say "1" = one 1 = "11"
countAndSay(3) = say "11" = two 1's = "21"
countAndSay(4) = say "21" = one 2 + one 1 = "12" + "11" = "1211"
</code></pre>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= n <= 30</code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
countAndSay
-