LeetCode-650. 2 Keys Keyboard [C++][Java]

LeetCode-650. 2 Keys Keyboardhttps://leetcode.com/problems/2-keys-keyboard/

题目描述

There is only one character 'A' on the screen of a notepad. You can perform two operations on this notepad for each step:

• Copy All: You can copy all the characters present on the screen (a partial copy is not allowed).
• Paste: You can paste the characters which are copied last time.

Given an integer n, return the minimum number of operations to get the character 'A' exactly n times on the screen.

Example 1:

Input: n = 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'.

Example 2:

Input: n = 1
Output: 0

Constraints:

• 1 <= n <= 1000

解题思路

【C++】

1. 动态规划

class Solution {
public:
    int minSteps(int n) {
        vector<int> dp(n + 1);
        int h = sqrt(n);
        for (int i = 2; i <= n; ++i) {
            dp[i] = i;
            for (int j = 2; j <= h; ++j) {
                if (i % j == 0) {
                    dp[i] = dp[j] + dp[i/j];
                    break;
                }
            }
        }
        return dp[n];
    }
};

2. 循环

更省空间，但时间多消耗了一点

class Solution {
public:
    int minSteps(int n) {
        int res = 0, factor = 2;
        while (n > 1) {
            if (n % factor == 0) {
                res += factor;
                n /= factor;
            } else factor++;
        }
        return res;
    }
};

【Java】

class Solution {
    public int minSteps(int n) {
        int[] dp = new int[n + 1];
        int h = (int) Math.sqrt(n);
        for (int i = 2; i <= n; ++i) {
            dp[i] = i;
            for (int j = 2; j <= h; ++j) {
                if (i % j == 0) {
                    dp[i] = dp[j] + dp[i/j];
                    break;
                }
            }
        }
        return dp[n];
    }
}