650. 2 Keys Keyboard

https://leetcode.com/problems/2-keys-keyboard/description/

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

解题思路：
dp[i]代表将字符串复制n次所需的最少操作
边界
初始化将dp数组中的值都赋为-1
dp[0]、dp[1]均为0
状态转移方程

如果i%j==0,则dp[i] = min(dp[i],dp[j]+i/j-1+1)，dp[i]可以通过复制dp[j]一次,粘贴i/j-1次得到dp[i] 

public class Keys_Keyboard_650 {

    /**
     * dp[i]代表将字符串复制n次所需的最少操作
     * 初始化将dp数组中的值都赋为-1
     * dp[0]、dp[1]均为0
     * 如果i%j==0,则dp[i] = min(dp[i],dp[j]+i/j-1+1)，dp[i]可以通过复制dp[j]一次,粘贴i/j-1次得到dp[i] 
     * @param n
     * @return
     */
    public int minSteps(int n) {
        int[] dp = new int[n+1];
        Arrays.fill(dp, Integer.MAX_VALUE);
        dp[0]=0;
        dp[1]=0;
        for(int i=2;i<n+1;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];
    }

    public static void main(String[] args) {
        System.out.println(new Keys_Keyboard_650().minSteps(3));
    }

}