File: root - text - article - 2020 - 01 - make-the-largest-number.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 340 Views, 23012 Search Bots | 41 Words
| Browse | Archive
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 340 Views, 23012 Search Bots | 41 Words
| Browse | Archive
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
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 340 Views, 23012 Search Bots | 41 Words 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
Related Articles
- How to Play WAV music under DOS?
- Sorting a list with 3 unique numbers
- Plus One
- Algorithm Interview Question: Nth Fibonacci Number
- [Daily Problem] Witness of The Tall People
- [Daily Problem] Remove Consecutive Nodes that Sum to 0
- Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree
- Daily Interview Problem: Jump to the End
- Find Pythagorean Triplets
- Staying on a Chess Board
©2006~2024 SteakOverCooked - 0.01578 Seconds(s) - 3413.977 KB/s - 43 Online Memory: 529.63 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="noindex, 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 !