public class FindSolution { private static boolean check(String s,String[] clauses){ for (String clause : clauses){ boolean clauseResult = false; for (int i = 0 ;i < clause.length(); i++){ char var = clause.charAt(i); boolean invert = false; if (var == '!'){ invert = true; var = clause.charAt(++i); } boolean value = (var == '1'); if (invert) value = !value; if (s.charAt(i) !=(value ? '1' : '0')){ clauseResult = false; break; }else { clauseResult = true; } } if (!clauseResult) return false; } return true; } public static void main(String[] args){ int n = 5 ; String[] clauses = new String[]{"!x1","x2","!x3x4","x5"}; StringBuilder sBuilder = new StringBuilder('0'.repeat(n)); while(true){ String s = sBuilder.toString(); if (check(s,clauses)){ System.out.println("Found a solution: " + s); return; } int carry = 1; for (int i = n-1;i >= 0; i--){ char c = sBuilder.charAt(i); if (c == '0'){ sBuilder.setCharAt(i,'1'); carry = 0; break; }else { sBuilder.setCharAt(i,'0'); } } if (carry == 1){ System.out.println("No solution found."); return; } } } }

这是一个Java实现，在给定的合取范式中搜索满足条件的二进制串：

public class FindSolution {
    private static boolean check(String s, String[] clauses) {
        for (String clause : clauses) {
            boolean clauseResult = false;
            for (int i = 0; i < clause.length(); i++) {
                char var = clause.charAt(i);
                boolean invert = false;
                if (var == '!') {
                    invert = true;
                    var = clause.charAt(++i);
                }
                boolean value = (var == '1');
                if (invert)
                    value = !value;
                if (s.charAt(i) != (value ? '1' : '0')) {
                    clauseResult = false;
                    break;
                } else {
                    clauseResult = true;
                }
            }
            if (!clauseResult)
                return false;
        }
        return true;
    }

    public static void main(String[] args) {
        int n = 5;
        String[] clauses = new String[]{"!x1", "x2", "!x3x4", "x5"};
        StringBuilder sBuilder = new StringBuilder('0'.repeat(n));
        while (true) {
            String s = sBuilder.toString();
            if (check(s, clauses)) {
                System.out.println("Found a solution: " + s);
                return;
            }
            int carry = 1;
            for (int i = n - 1; i >= 0; i--) {
                char c = sBuilder.charAt(i);
                if (c == '0') {
                    sBuilder.setCharAt(i, '1');
                    carry = 0;
                    break;
                } else {
                    sBuilder.setCharAt(i, '0');
                }
            }
            if (carry == 1) {
                System.out.println("No solution found.");
                return;
            }
        }
    }
}

其中，`check`方法根据给定的合取范式和一个二进制串，判断这个二进制串是否满足合取范式。`main`方法是主函数，循环搜索二进制串并进行判断，直到找到一个解或者无解为止。