• [Leetcode]650. 2 Keys Keyboard



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

    class Solution {
    public:
        int minSteps(int n) {
            if (n == 1)
                return 0;
            int dp[n]; dp[0] = 0; dp[1] = 2;
            for (int i = 3; i <= n; ++i){
                int index = -1;
                for (int j = 2; j < i; ++j)
                    if (i % j == 0)
                        index = j;
                if (index == -1)
                    dp[i-1] = i;
                else 
                    dp[i-1] = dp[index-1] + (i / index);
            }
            return dp[n-1];
        }
    };
  • 相关阅读:
    实现分布式爬虫
    hadoop安装文档
    远程连接mysql和redis配置
    scrapy(2)
    10月10号动手动脑
    10月6日和动手动脑
    10月4日
    课程总结
    又学java的第一天
    第一节测试总结
  • 原文地址:https://www.cnblogs.com/David-Lin/p/8359027.html
Copyright © 2020-2023  润新知