题目:
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].
思路:
这道题是动态规划题,状态转移方程不是很明显,需要仔细分析。
先把dp的最小不走都设置为无穷大(0x7FFFFFFF
), 初始化条件为:
dp[0]=dp[1]=0
,状态转移方程为:
dp[i]=min(dp[i],dp[j]+i/j),i>1,j<i且i是j的整数倍
上述状态转移方程表示:如果i
是j
的倍数,那么i
可以通过粘贴(i/j-1
)次j
得到, 再加上一次复制操作,那么可以通过dp[j]+i/j
次操作得到dp[i]
.
C++代码如下:
class Solution {
public:
int minSteps(int n) {
vector<int> dp(n+1,0x7FFFFFFF);
dp[0] = dp[1] = 0;
for(int i=2;i<n+1;++i){
for(int j=1;j<i;++j){
if(i%j==0){
dp[i] = min(dp[i], dp[j]+i/j);
}
}
}
return dp[n];
}
};