g0001_0100.s0093_restore_ip_addresses.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.37

package g0001_0100.s0093_restore_ip_addresses;

// #Medium #String #Backtracking #2022_02_21_Time_12_ms_(26.89%)_Space_43.2_MB_(22.54%)

import java.util.ArrayList;
import java.util.List;

public class Solution {
    public List restoreIpAddresses(String s) {
        List results = new ArrayList<>();
        step(s, 0, new int[4], 0, results);
        return results;
    }

    void step(String s, int pos, int[] octets, int count, List results) {
        if (count == 4 && pos == s.length()) {
            results.add(
                    String.valueOf(octets[0])
                            + '.'
                            + octets[1]
                            + '.'
                            + octets[2]
                            + '.'
                            + octets[3]);
        } else if (count < 4 && pos < 12) {
            int octet = 0;
            for (int i = 0; i < 3; i++) {
                if (pos + i < s.length()) {
                    int digit = s.charAt(pos + i) - '0';
                    octet = octet * 10 + digit;
                    if (octet < 256) {
                        octets[count] = octet;
                        step(s, pos + i + 1, octets, count + 1, results);
                    }
                    if (i == 0 && digit == 0) {
                        break;
                    }
                }
            }
        }
    }
}