leetcode: 2 Keys Keyboard

Question

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].

Solution1

如果一个数k能被q整除得到m，那么能获得k个A的方法是在m个A的基础上操作q次：复制1次，粘贴（q-1）次；获得m个A的方法同理。所以这个问题转变为求n除1以外的因子。

class Solution {
    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;
    }
}

Solution2

DP的解题思路与方法1相似

class Solution {
    public int minSteps(int n) {
        int[] dp = new int[n+1];
        for(int i = 2;i<n+1;i++){
            dp[i] = i;
            for(int j = i-1;j>1;j--){
            	//对于i个A，寻找能被i整除的最大的j（j<i）    
                if(i%j==0){
                    dp[i] = Math.min(dp[i],dp[j]+(i/j));
                    break;
                }
            }
        }
        return dp[n];
    }
}