[leetcode-650-2 Keys Keyboard]

Posted hellowOOOrld

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[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‘.

 

Note:

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

思路:

如果知道了i的结果,那么2×i的步骤只需在i的结果上加上2即可,一次复制,一次粘贴。同理3×i的结果为一次复制,两次粘贴,i的结果加上3。

int minSteps(int n)
{
  int step[1010];
  for(int i=0;i<1010;++i)step[i]= 1010;
  step[1] = 0;
  for(int i=1;i<=1000;i++)
  {
    int k =2;
    for(int j=i*2;j<=1000;j+=i)
    {
      step[j] = min(step[j],step[i]+k);
      k++;
    }
  }
  return step[n];  
 }

 

以上是关于[leetcode-650-2 Keys Keyboard]的主要内容,如果未能解决你的问题,请参考以下文章

leetcode 650. 2 Keys Keyboard 只有两个键的键盘(中等)

返回不包括指定键的字典副本

多个匹配的正则表达式.net c#

python中的列表和字典

json Visual Studio Code的默认键绑定。源代码来自干净的Insiders版本(2016-02-07),并被格式化为单个keyb

SQL Server 聚集索引 - 索引顺序问题