喂食仓鼠的最小食物桶数

/*
 * Problem: Given a string 'hamsters', where 'H' indicates a hamster and '.' indicates an empty spot, we need to place food buckets in the empty spots such that each hamster has access to at least one food bucket either to its left or right. Return the minimum number of food buckets needed, or -1 if it is impossible to feed all hamsters.
 * 
 * Solution: Using Java Streams, we can iterate through the string, count the minimum number of buckets required and ensure all 'H' characters have access to a bucket. 
 */

import java.util.stream.IntStream;

public class HamstersFeedingStream {
    public int minBuckets(String hamsters) {
        int[] result = {0, 0}; // {buckets, lastBucketPosition}
        IntStream.range(0, hamsters.length()).forEach(i -> {
            if (hamsters.charAt(i) == 'H') {
                if (i > 0 && hamsters.charAt(i - 1) == '.') {
                    result[0]++;
                    result[1] = i - 1;
                } else if (i < hamsters.length() - 1 && hamsters.charAt(i + 1) == '.') {
                    result[0]++;
                    result[1] = i + 1;
                } else if (i == 0 || result[1] != i - 1) {
                    result[0] = -1;
                }
            }
        });
        return result[0];
    }
}