给定一个小写字母组成的字符s，请找出字符串中两个不同的位置的字符作为分割点，使得字符串分成三个连续字符串且子串权重相等，注意子串不包含分割点。 若能找到满足条件的分割点，请输出这两个分割点在字符串中的

public static int[] findEqualWeightSubstrings(String s) {
    int n = s.length();
    int totalWeight = 0;
    for (char c : s.toCharArray()) {
        totalWeight += (int) c;
    }

    int[] prefixSum = new int[n + 1];
    for (int i = 0; i < n; i++) {
        prefixSum[i + 1] = prefixSum[i] + (int) s.charAt(i);
    }

    for (int i = 1; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            int leftWeight = prefixSum[i];
            int middleWeight = prefixSum[j] - prefixSum[i+1];
            int rightWeight = totalWeight - prefixSum[j+1];
            if (leftWeight == middleWeight && middleWeight == rightWeight) {
                return new int[]{i, j};
            }
        }
    }

    return new int[]{0, 0};
}