650. 2 Keys Keyboard
Initially on a notepad only one character 'A' is present. You can perform two operations on this notepad for each step:
Copy All
: You can copy all the characters present on the notepad (partial copy is not allowed).Paste
: You can paste the characters which are copied last time.
Given a number n
. You have to get exactly n
'A' on the notepad by performing the minimum number of steps permitted. Output the minimum number of steps to get n
'A'.
Example 1:
Input: 3 Output: 3 Explanation: Intitally, 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'.
Note:
- The
n
will be in the range [1, 1000].
题目链接:https://leetcode.com/problems/2-keys-keyboard/description/
题目大意:记事本上最初有一个字母'A',给定两种操作:(1)Copt All :复制记事本上所有 'A' ;(2)Paste : 粘贴复制的内容。求获得 n 个 'A' 的最少操作步骤。
解题思路:动态规划:如果 a 是 b 的倍数,可通过拷贝 b 得到 a,得到状态转移方程:dp[ (i-1) * j ] = min ( dp[(i-1) * j ] , dp[ i-1 ] + j ) ; 其中,(i-1) 表示 (i-1) 个'A',dp[ i-1 ]表示获得(i-1) 个'A' 的最少步骤,获取 j 倍 ( i-1 ) 个 'A' 的步骤数可通过粘贴 j 次 ( i-1 ) 个 'A',步骤数就用 dp[i-1] + j 表示。
代码:
class Solution {
public:
int minSteps(int n) {
int dp[1005];
for(int i = 0;i < 1005;i ++){
dp[i] = 1e8;
}
if (n == 1)
return 0;
if (n == 2)
return 2;
dp[1] = 0;
dp[2] = 2;
for(int i = 3;i <= n ;i ++){
for(int j = 2;(i-1) * j <= n; j ++){
dp[(i-1) * j] = min((i-1) * j , dp[i-1] + j);
}
if (dp[i] == 1e8){ // i 不是除了1和本身外的其他数字的倍数
dp[i] = i;
}
}
return dp[n];
}
};