文件: root - text - article - 2020 - 01 - max-and-min-with-limited-comparisons.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 471 次阅读, 28879 次搜索 | 58 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 471 次阅读, 28879 次搜索 | 58 个单词
| 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Microsoft:
Given a list of numbers of size n, where n is greater than 3, find the maximum and minimum of the list using less than 2 * (n - 1) comparisons.
Here's a start:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 471 次阅读, 28879 次搜索 | 58 个单词 Given a list of numbers of size n, where n is greater than 3, find the maximum and minimum of the list using less than 2 * (n - 1) comparisons.
Here's a start:
def find_min_max(nums):
# Fill this in.
print find_min_max([3, 5, 1, 2, 4, 8])
# (1, 8)
猜您喜欢...
- Algorithm Interview: Convert Roman Numerals to Decimal
- Spreadsheet Column Title
- Daily Interview Problem: Deepest Node in a Binary Tree
- Sorting a list with 3 unique numbers
- Algorithm Interview: No Adjacent Repeating Characters
- Daily Interview Problem: First Missing Positive Integer
- Spreadsheet Columns
- Algorithm Interview Question: Symmetric k-ary Tree
- Daily Interview Problem: Jump to the End
- A trick for getting good at coding interviews FASTER
©2006~2024 牛排过熟 - 0.00887 秒 - 6190.805 KB/s - 45 在线 内存: 516.87 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="不索引, 跟踪" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
评论 (0)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。