问题:
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].
解决:
① 计算复制粘贴的次数。找规律
n=1, minSteps=0;
n=2, 步骤:cp,minSteps=2
n=3, 步骤:cpp, minSteps=3
n=4, 步骤: cppp或者 cpcp(复制S[2]并粘贴一次),minSteps=4
n=5, 步骤:cpppp=c+p*4,minSteps=5
n=6, 步骤:c+p*5 或者 cp(cpp) (复制S[2]并粘贴2次) 或者 cpp(cp)(复制S[3]并粘贴1次), minSteps=5
。。。。。
n=12, 步骤:c+p*11,
或者 先取得“AA”然后c+p*5(这里5=(12-2)/2),S[n] = S[n/2] + 1+(n-2)/2 = S[n/2] + n/2
或者 先取得 “AAA”然后c+p*3(这里3=(12-3)/3),S[n] = S[n/3] + 1+(n-3)/3 = S[n/3] + n/
或者 先取得“AAAA”然后c+p*2(这里2=(12-4)/4),S[n] = S[n/4] + 1+(n-4)/4 = S[n/4] + n/4
从上面可以看到
S[n] = min(S[n],S[n/i]+n/i) 其中i为能被n整除的数
class Solution { //12ms
public int minSteps(int n) {
if (n == 1) return 0;
int res = n;
for (int i = n - 1;i > 1;i --){
if (n % i == 0){
res = Math.min(res,minSteps(n / i) + i);
}
}
return res;
}
}
进化版:
class Solution { //9ms
public int minSteps(int n) {
if (n == 1) return 0;
for (int i = 2; i < n; i ++)
if (n % i == 0) return i + minSteps(n / i);
return n;
}
}
② 动态规划。
class Solution { //80ms
public int minSteps(int n) {
int[] dp = new int[n + 1];
for (int i = 2;i <= n;i ++){
dp[i] = i;
for (int j = i - 1;j > 1;j --){
if (i % j == 0){
dp[i] = Math.min(dp[i],dp[j] + i / j);
}
}
}
return dp[n];
}
}
③
class Solution { //11ms
public int minSteps(int n) {
int res = 0;
for (int i = 2; i <= n; ++ i) {
while (n % i == 0) {
res += i;
n /= i;
}
}
return res;
}
}