zoukankan      html  css  js  c++  java
  • LC 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'.
    

    Note:

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

    Runtime: 4 ms, faster than 73.56% of C++ online submissions for 2 Keys Keyboard.

    只能进行copy和past,其实是质数问题。能通过copy和paste达到的一定是合数。

    class Solution {
    public:
      int minSteps(int n) {
        if(n == 1) return 0;
        for(int i=2; i<n; i++){
          if(n % i == 0) return minSteps(n/i) + i;
        }
        return n;
      }
    };
  • 相关阅读:
    打造分布式爬虫
    vue入门-常用指令操作
    爬虫练习-爬取小说
    爬虫项目-爬取亚马逊商品信息
    爬虫框架_scrapy1
    CIE-LUV是什么颜色特征
    多目标跟踪baseline methods
    时间序列识别代码调试版本1
    拓扑空间1
    ps cs6破解
  • 原文地址:https://www.cnblogs.com/ethanhong/p/10195888.html
Copyright © 2011-2022 走看看