g0601_0700.s0650_2_keys_keyboard.readme.md Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation
Show all versions of leetcode-in-java Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
The newest version!
650\. 2 Keys Keyboard
Medium
There is only one character `'A'` on the screen of a notepad. You can perform two operations on this notepad for each step:
* Copy All: You can copy all the characters present on the screen (a partial copy is not allowed).
* Paste: You can paste the characters which are copied last time.
Given an integer `n`, return _the minimum number of operations to get the character_ `'A'` _exactly_ `n` _times on the screen_.
**Example 1:**
**Input:** n = 3
**Output:** 3
**Explanation:**
Initially, we have one character 'A'.
In step 1, we use Copy All operation.
In step 2, we use Paste operation to get 'AA'.
In step 3, we use Paste operation to get 'AAA'.
**Example 2:**
**Input:** n = 1
**Output:** 0
**Constraints:**
* `1 <= n <= 1000`
© 2015 - 2024 Weber Informatics LLC | Privacy Policy