int cnt = 0, n = c.size(), i = 0; while(i < n - 1){ if(c[i] == 0 && c[i+2] == 0) i += 2; else i++; cnt++; } return cnt;

PYTHON 3 SOLUTION

def jumpingOnClouds(c):
    # Write your code here
    j = 0
    i = 0
    while i < (len(c) - 1):
        if i + 2 < len(c) and c[i+2] != 1:
            i = i + 2
        else:
            i = i + 1
        j = j + 1
    return j 

Java 8 solution;

i didnt try to count zeros at c list. i try count 1 at c.list i add to index of "1" from c list to new arraylist. and substraction between two index.

    List<Integer> indexofOnes= new ArrayList<>();

    int lastIndexOfOnes=0;
    for(int i=0; i<c.size();i++){
        if(c.get(i)==1){
            indexofOnes.add(i+1);
            lastIndexOfOnes=i+1;
        }
    }
    int jump=0;
    int beforeJump=0;
    int count =0;
    for(Integer item: indexofOnes){
        jump=(item-beforeJump+1)/2;
        if(item-beforeJump==1 || item-beforeJump==0){
            jump++;
        }
        beforeJump=item;
        count=count+jump;
    }


    int lastJump=(c.size()-lastIndexOfOnes)/2;
    int endOfJump=count+lastJump;
    return endOfJump;
}