文件: root - text - article - 2020 - 01 - make-the-largest-number.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 528 次阅读, 24879 次搜索 | 41 个单词
| 浏览 | 博客存档
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 528 次阅读, 24879 次搜索 | 41 个单词
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by Uber:
Given a number of integers, combine them so it would create the largest number.
Example:
Input: [17, 7, 2, 45, 72]
Output: 77245217
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 528 次阅读, 24879 次搜索 | 41 个单词 Given a number of integers, combine them so it would create the largest number.
Example:
Input: [17, 7, 2, 45, 72]
Output: 77245217
def largestNum(nums):
# Fill this in.
print largestNum([17, 7, 2, 45, 72])
# 77245217
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
猜您喜欢...
- Daily Interview Problem: Word Ordering in a Different Alphabetical Order
- Daily Interview Puzzle: Minimum Size Subarray Sum
- Daily Interview Problem: Spiral Traversal of Grid
- [Daily Problem] Witness of The Tall People
- Daily Interview Problem: Largest BST in a Binary Tree
- Reverse a Directed Graph
- First and Last Indices of an Element in a Sorted Array
- Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree
- Algorithm Interview Question: H-Index
- Algorithm Interview: Convert Roman Numerals to Decimal
©2006~2024 牛排过熟 - 0.00793 秒 - 6852.925 KB/s - 87 在线
内存: 516.4 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
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。