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

 

SRE实战 互联网时代守护先锋，助力企业售后服务体系运筹帷幄！一键直达领取阿里云限量特价优惠。

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

代码：

class Solution {
public:
    int minSteps(int n) {
        int dp[1010];
        memset(dp, 0, sizeof(dp));
        if(n == 1) return 0;
        for(int i = 1; i <= 1000; i ++) {
            if(isPrime(i))
                dp[i] = i;
            else {
                int t = getmaxx(i);
                dp[i] = dp[t] + (i / t);
            }
        }
        return dp[n];
    }
    bool isPrime(int x) {
        if(x == 2) return true;
        for(int i = 2; i * i <= x; i ++) 
            if(x % i == 0) return false;
        return true;
    }
    int getmaxx(int x) {
        for(int i = 2; i * i <= x; i ++) {
            if(x % i == 0) return (x / i);
        }
        return x;
    }
};

　　找规律？

想变成一个优秀的人啊

FH 

扫码关注我们
微信号：SRE实战
拒绝背锅 运筹帷幄