页面顶部 Top
文件:  root - text - article - 2020 - 01 - make-the-largest-number.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 284 次阅读, 20541 次搜索 | 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

def largestNum(nums):
# Fill this in.

print largestNum([17, 7, 2, 45, 72])
# 77245217
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 284 次阅读, 20541 次搜索 | 41 个单词 定阅此目录的博客

猜您喜欢...

  1. PHP Unit Tests on VPS Server
  2. [Daily Problem] Move Zeros
  3. A trick for getting good at coding interviews FASTER
  4. Fix Brackets
  5. YES!!
  6. Staying on a Chess Board
  7. [Daily Problem] Longest Increasing Subsequence
  8. Daily Interview Problem: Maximum Profit From Stocks
  9. Daily Interview Problem: Merge List Of Number Into Ranges
  10. Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree

评论 (0)

    当前页暂时没有评论。


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />