文件: root - text - article - 2019 - 10 - sorting-a-list-with-3-unique-numbers.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 508 次阅读, 25225 次搜索 | 51 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 508 次阅读, 25225 次搜索 | 51 个单词
| 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Google:
Given a list of numbers with only 3 unique numbers (1, 2, 3), sort the list in O(n) time.
Example 1:
Input: [3, 3, 2, 1, 3, 2, 1]
Output: [1, 1, 2, 2, 3, 3, 3]
Challenge: Try sorting the list using constant space.
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 508 次阅读, 25225 次搜索 | 51 个单词 Given a list of numbers with only 3 unique numbers (1, 2, 3), sort the list in O(n) time.
Example 1:
Input: [3, 3, 2, 1, 3, 2, 1]
Output: [1, 1, 2, 2, 3, 3, 3]
def sortNums(nums):
# Fill this in.
print sortNums([3, 3, 2, 1, 3, 2, 1])
# [1, 1, 2, 2, 3, 3, 3]
Challenge: Try sorting the list using constant space.
猜您喜欢...
- Daily Interview Problem: Spiral Traversal of Grid
- Consecutive Ones
- Generate All IP Addresses
- Spreadsheet Columns
- Design Tic-Tac-Toe
- Longest Substring Without Repeating Characters
- Daily Interview Problem: Reverse Integer
- Daily Interview Problem: Sort Colors
- Daily Interview Problem: Room scheduling
- Multitasking
©2006~2024 牛排过熟 - 0.0094 秒 - 5787.491 KB/s - 67 在线 内存: 516.91 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)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。