Leet Code 2105 - Watering Plants II

public class LeetCode_2105 {
    public static void main(String[] args) {

        int[] plants = {2, 1, 1};
        System.out.println(minimumRefill(plants, 2, 2));
    }

    public static int minimumRefill(int[] plants, int capacityA, int capacityB) {

        int AliceCan = capacityA;
        int BobCan = capacityB;

        int left = 0;
        int right = plants.length - 1;
        int count = 0;
        while (left < right) {
            // check if Alice can't give water, then fill Alice's Can
            if (plants[left] > AliceCan) {
                AliceCan = capacityA;
                count++;
            }
            AliceCan -= plants[left];

            // check if Bob can't give water, then fill Bob's Can
            if (plants[right] > BobCan) {
                BobCan = capacityB;
                count++;
            }
            BobCan -= plants[right];

            left++;
            right--;
        }
        // if dono ke paas paani kam hai, to count++
        if (left == right && (AliceCan < plants[left] && BobCan < plants[right])) {
            count++;
        }
        return count;
    }
}