文件: root - text - article - 2020 - 02 - kaprekar.txt.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 1035 次阅读, 22186 次搜索 | 134 个单词
| 浏览 | 博客存档
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 1035 次阅读, 22186 次搜索 | 134 个单词
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by Facebook:
Kaprekar's Constant is the number 6174. This number is special because it has the property where for any 4-digit number that has 2 or more unique digits, if you repeatedly apply a certain function it always reaches the number 6174.
This certain function is as follows:
- Order the number in ascending form and descending form to create 2 numbers.
- Pad the descending number with zeros until it is 4 digits in length.
- Subtract the ascending number from the descending number.
- Repeat.
Given a number n, find the number of times the function needs to be applied to reach Kaprekar's constant. Here's some starter code:
KAPREKAR_CONSTANT = 6174
def num_kaprekar_iterations(n):
# Fill this in.
print num_kaprekar_iterations(123)
# 3
# Explanation:
# 3210 - 123 = 3087
# 8730 - 0378 = 8352
# 8532 - 2358 = 6174 (3 iterations)
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 1035 次阅读, 22186 次搜索 | 134 个单词 Kaprekar's Constant is the number 6174. This number is special because it has the property where for any 4-digit number that has 2 or more unique digits, if you repeatedly apply a certain function it always reaches the number 6174.
This certain function is as follows:
- Order the number in ascending form and descending form to create 2 numbers.
- Pad the descending number with zeros until it is 4 digits in length.
- Subtract the ascending number from the descending number.
- Repeat.
Given a number n, find the number of times the function needs to be applied to reach Kaprekar's constant. Here's some starter code:
KAPREKAR_CONSTANT = 6174
def num_kaprekar_iterations(n):
# Fill this in.
print num_kaprekar_iterations(123)
# 3
# Explanation:
# 3210 - 123 = 3087
# 8730 - 0378 = 8352
# 8532 - 2358 = 6174 (3 iterations)
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
猜您喜欢...
- Daily Interview Problem: Min Stack
- Algorithm Interview Question: Symmetric k-ary Tree
- Making a Height Balanced Binary Search Tree
- Top K Frequent words
- Algorithm Interview: Maximum Path Sum in Binary Tree
- Daily Interview Problem: Full Binary Tree
- Daily Interview Problem: Trapping Rainwater
- [Daily Problem] Longest Increasing Subsequence
- A trick for getting good at coding interviews FASTER
- Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
©2006~2024 牛排过熟 - 0.01307 秒 - 1597.923 KB/s - 13 在线
内存: 493.9 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="索引, 跟踪">
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。