算法不是套模板，而是具体问题具体对策

一、题目

 

二、代码：

/**
 * @param {string} street
 * @return {number}
 */
var minimumBuckets = function(street) {
    let result = 0;
    let index = -1;
    let prev_index = index;
    street[-1] = 'o';
    let shared = -1;
    while(true) {
        prev_index = index;
        index = street.indexOf('H',index + 1);
        if(index < 0) {
            break;
        }
        if(street[index - 1] == '.' || street[index + 1] == '.') {
            result++;
        } else {
            return -1;
        }
        if(prev_index >=0 && prev_index == index - 2 && shared != prev_index) {
            shared = index;
            result--;
        } 
    }

    return result;
};