文件: root - text - article - 2020 - 01 - make-the-largest-number.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 570 次阅读, 25856 次搜索 | 41 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 570 次阅读, 25856 次搜索 | 41 个单词
| 浏览 | 博客存档
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, | 英文 | 主页 | 类别: 计算机科学 | 570 次阅读, 25856 次搜索 | 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
猜您喜欢...
- Staying on a Chess Board
- Algorithm Interview: Convert Roman Numerals to Decimal
- Daily Interview Problem: Sort Colors
- Daily Interview Problem: Circle of Chained Words
- Kaprekar
- Skip the readings, focus on problems. And use all the hints!
- Daily Interview Problem: Contiguous Subarray with Maximum Sum
- Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
- Daily Interview Problem: Look and Say Sequence
- How to Play WAV music under DOS?
©2006~2024 牛排过熟 - 0.01249 秒 - 1546.96 KB/s - 33 在线 内存: 492.48 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)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。