count-houses-in-a-circular-street.cpp

// Time:  O(k)
// Space: O(1)

// constructive algorithms
class Solution {
public:
    int houseCount(Street* street, int k) {
        for (int _ = 0; _ < k; ++_) {
            street->closeDoor();
            street->moveRight();
        }
        int result = 0;
        for (; result < k; ++result) {
            if (street->isDoorOpen()) {
                break;
            }
            street->openDoor();
            street->moveRight();
        }
        return result;
    }
};