650 2 Keys Keyboard

1 题目

Initially on a notepad only one character 'A' is present. You can perform two operations on this notepad for each step:

1. Copy All: You can copy all the characters present on the notepad (partial copy is not allowed).
2. 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:

1. The n will be in the range [1, 1000].

2 尝试解

2.1 分析

初始时只有一个字母A，两种操作，全部复制和粘贴。问至少要多少步操作，能获得长度为n的字符串。

首先，如果每个数都只由1个A复制粘贴得到，则需要1次复制和n-1次粘贴共n次操作。对于素数，只能这样得到。对于合数，检查其每一个小于其的因子，F(n) = min(F(n/k) + k) for n%k == 0。

2.2 代码

class Solution {
public:
    int minSteps(int n) {
        vector<int> saver(n+1,INT_MAX);
        saver[1] = 0;
        return minStepsAux(n,saver);
    }
    int minStepsAux(int n,vector<int> saver){
        if(saver[n] != INT_MAX) return saver[n];
        saver[n] = n;
        for(int i = 2; i <= n/2; i++){
            if(n % i == 0){
                saver[n] = min(saver[n],minStepsAux(i,saver)+n/i);
            }    
        }
        return saver[n];
    }
};

3 标准解

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