File: root - text - article - 2020 - 01 - max-and-min-with-limited-comparisons.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 472 Views, 28930 Search Bots | 58 Words
| Browse | Archive
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 472 Views, 28930 Search Bots | 58 Words
| Browse | Archive
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:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 472 Views, 28930 Search Bots | 58 Words 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)
Related Articles
- ImageMagick Vulnerabilities - CVE-2016–3714
- Daily Interview Question: Edit Distance
- YES!!
- Daily Interview Problem: Running Median
- Daily Interview Puzzle: Intersection of Linked Lists
- Daily Interview Problem: Buddy Strings
- Reverse a Linked List
- Algorithm Interview Question: Symmetric k-ary Tree
- Algorithm Interview: Permutations of numbers
- Longest Substring Without Repeating Characters
©2006~2024 SteakOverCooked - 0.01021 Seconds(s) - 1925.871 KB/s - 44 Online Memory: 493.32 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Comments (0)
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !