File: root - text - article - 2020 - 02 - generate-all-ip-addresses.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 281 Views, 22164 Search Bots | 99 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 281 Views, 22164 Search Bots | 99 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
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']
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 281 Views, 22164 Search Bots | 99 Words 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']
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- Binary Tree Level with Minimum Sum
- Two-Sum
- Invert a Binary Tree
- Daily Interview Problem: Buddy Strings
- Daily Interview Problem: Trapping Rainwater
- Daily Interview Problem: Deepest Node in a Binary Tree
- Daily Interview Problem: Given two arrays, write a function to compute their intersection.
- Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
- Algorithm Interview Question: H-Index
- Daily Interview Puzzle: Falling Dominoes
©2006~2024 SteakOverCooked - 0.01192 Seconds(s) - 1661.615 KB/s - 29 Online
Memory: 494.1 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="index, follow">
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !