650. 2 Keys Keyboard

1. Description

Originally, there is one 'A'. Given n, find the minimum number of steps to get n 'A'.

2. Solution

Dynamic Programming.

dp[i]=i;

dp[i] = min(dp[i],dp[j]+(i/j)), if i%j==0.

3. Code

int minSteps(int n) {
int dp[n+1];
dp[1]=0;
for(int i=2;i<=n;i++){
dp[i]=i;
for(int j=2;j<i;j++){
if(i%j==0){
dp[i]=min(dp[i],dp[j]+(i/j));
}
}
}
return dp
;
}