Package g0601_0700.s0650_2_keys_keyboard
Class Solution
java.lang.Object
g0601_0700.s0650_2_keys_keyboard.Solution
650 - 2 Keys Keyboard.<p>Medium</p>
<p>There is only one character <code>'A'</code> on the screen of a notepad. You can perform two operations on this notepad for each step:</p>
<ul>
<li>Copy All: You can copy all the characters present on the screen (a partial copy is not allowed).</li>
<li>Paste: You can paste the characters which are copied last time.</li>
</ul>
<p>Given an integer <code>n</code>, return <em>the minimum number of operations to get the character</em> <code>'A'</code> <em>exactly</em> <code>n</code> <em>times on the screen</em>.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> n = 3</p>
<p><strong>Output:</strong> 3</p>
<p><strong>Explanation:</strong></p>
<p>Initially, we have one character ‘A’.</p>
<p>In step 1, we use Copy All operation.</p>
<p>In step 2, we use Paste operation to get ‘AA’.</p>
<p>In step 3, we use Paste operation to get ‘AAA’.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> n = 1</p>
<p><strong>Output:</strong> 0</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= n <= 1000</code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
minSteps
public int minSteps(int n)
-