页面顶部 Top
文件:  root - text - article - 2020 - 02 - generate-all-ip-addresses.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 216 次阅读, 20033 次搜索 | 99 个单词

定阅此目录的博客 | 浏览 | 博客存档
i, here's your problem today. This problem was recently asked by Microsoft:

An IP Address is in the format of A.B.C.D, where A, B, C, D are all integers between 0 to 255.

Given a string of numbers, return the possible IP addresses you can make with that string by splitting into 4 parts of A, B, C, D.

Keep in mind that integers can't start with a 0! (Except for 0)

Example:
Input: 1592551013
Output: ['159.255.101.3', '159.255.10.13']

def ip_addresses(s, ip_parts=[]):
# Fill this in.

print ip_addresses('1592551013')
# ['159.255.101.3', '159.255.10.13']
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 216 次阅读, 20033 次搜索 | 99 个单词 定阅此目录的博客

猜您喜欢...

  1. Fibonacci coding
  2. Consecutive Ones
  3. Maximum In A Stack
  4. Autorun.inf Virus Protection
  5. [Daily Problem] Angles of a Clock
  6. Daily Interview Problem: Deepest Node in a Binary Tree
  7. CPU Utilization
  8. Daily Interview Problem: First Missing Positive Integer
  9. Making a Height Balanced Binary Search Tree
  10. Algorithm Interview Question: Max and Min with Limited Comparisons

评论 (0)

    当前页暂时没有评论。


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