-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrestore-ip-addresses.js
More file actions
63 lines (52 loc) · 1.6 KB
/
restore-ip-addresses.js
File metadata and controls
63 lines (52 loc) · 1.6 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
/**
* Problem: Restore IP Addresses
* Link: https://leetcode.com/problems/restore-ip-addresses/
* Difficulty: Medium
*
* Return all valid IP addresses from a string of digits.
*
* Example: "25525511135" => ["255.255.11.135","255.255.111.35"]
*
* Time Complexity: O(1) bounded by IP format (max 27 combinations)
* Space Complexity: O(1)
*/
// JavaScript Solution - Backtracking
function restoreIpAddresses(s) {
const result = [];
function backtrack(start, parts) {
if (parts.length === 4) {
if (start === s.length) result.push(parts.join('.'));
return;
}
for (let len = 1; len <= 3; len++) {
if (start + len > s.length) break;
const segment = s.substring(start, start + len);
if (segment.length > 1 && segment[0] === '0') break; // no leading zeros
if (parseInt(segment) > 255) break; // max 255
parts.push(segment);
backtrack(start + len, parts);
parts.pop(); // backtrack
}
}
backtrack(0, []);
return result;
}
module.exports = restoreIpAddresses;
/* Python Solution:
def restoreIpAddresses(s):
result = []
def backtrack(start, parts):
if len(parts) == 4:
if start == len(s): result.append('.'.join(parts))
return
for length in range(1, 4):
if start + length > len(s): break
segment = s[start:start+length]
if len(segment) > 1 and segment[0] == '0': break
if int(segment) > 255: break
parts.append(segment)
backtrack(start + length, parts)
parts.pop()
backtrack(0, [])
return result
*/