leetcode650 2 Keys Keyboard
2017-08-28 16:46
411 查看
思路:
把给定的数分解质因子之后,对于每一个质因子x,都需要x次操作(一次copy all操作和x-1次paste),所以答案就是对分解后的所有质因子求和。
实现:
把给定的数分解质因子之后,对于每一个质因子x,都需要x次操作(一次copy all操作和x-1次paste),所以答案就是对分解后的所有质因子求和。
实现:
1 class Solution 2 { 3 public: 4 int minSteps(int n) 5 { 6 int sum = 0; 7 for (int i = 2; i <= n; i++) 8 { 9 while (n % i == 0) 10 { 11 sum += i; 12 n /= i; 13 } 14 } 15 return sum; 16 } 17 };
相关文章推荐
- Leetcode刷题:650. 2 Keys Keyboard
- LeetCode 650 - 2 Keys Keyboard
- LeetCode - 650 - 2 Keys Keyboard
- Leetcode刷题总结:650. 2 Keys Keyboard
- LeetCode 650 2 Keys Keyboard - LeetCode Weekly Contest 43
- LeetCode: -Dynamic Programming-2 Keys Keyboard[650]-复制粘贴问题
- leetcode 650. 2 Keys Keyboard(dp)
- LeetCode-2 Keys Keyboard
- 动态规划中级教程。 650. 2 Keys Keyboard
- LeetCode 4 Keys Keyboard
- [LeetCode] 651. 4 Keys Keyboard 四键的键盘
- LeetCode-2 Keys Keyboard
- Leetcode 650. 2 Keys Keyboard
- [LeetCode] 650. 2 Keys Keyboard 两键的键盘
- [leetcode]651. 4 Keys Keyboard
- [LeetCode] 2 Keys Keyboard
- leetcode 650. 2 Keys Keyboard
- Leetcode Algorithms - Dynamic Programming:650. 2 Keys Keyboard
- LeetCode:2 Keys Keyboard
- LeetCode650. 2 Keys Keyboard