g0701_0800.s0756_pyramid_transition_matrix.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 g0701_0800.s0756_pyramid_transition_matrix;

// #Medium #Depth_First_Search #Breadth_First_Search #Bit_Manipulation
// #2022_03_25_Time_129_ms_(82.94%)_Space_40.5_MB_(95.88%)

import java.util.List;

public class Solution {
    private boolean dfs(char[] c, int i, int l, int[][] map) {
        if (l == 1) {
            return true;
        }
        if (i == l - 1) {
            return dfs(c, 0, l - 1, map);
        }
        char save = c[i];
        char p = 'A';
        for (int v = map[c[i] - 'A'][c[i + 1] - 'A']; v != 0; v >>= 1, p++) {
            if ((v & 1) != 0) {
                c[i] = p;
                if (dfs(c, i + 1, l, map)) {
                    return true;
                }
            }
        }
        c[i] = save;
        return false;
    }

    public boolean pyramidTransition(String bottom, List allowed) {
        int[][] map = new int[7][7];
        for (String s : allowed) {
            map[s.charAt(0) - 'A'][s.charAt(1) - 'A'] |= 1 << (s.charAt(2) - 'A');
        }
        return dfs(bottom.toCharArray(), 0, bottom.length(), map);
    }
}