Hackerrank 01: Jumping on the Clouds

https://www.hackerrank.com/challenges/jumping-on-the-clouds/problem?h_l=interview&h_r=next-challenge&h_r=next-challenge&h_v=zen&h_v=zen&page=9597&playlist_slugs%5B%5D=interview-preparation-kit&playlist_slugs%5B%5D=warmup

Notes:

An interesting question. The key is: can you make your code cleaner?

See one of example below:

int jumpingOnClouds(vector<int> c) {
    int res = 0;
    for(int i=0; i+1<c.size(); ) {//only need to reach the last one;
        if(i+2<c.size() && c[i+2] == 1) ++i;//can only jump one step;
        else i += 2;//jump two steps;
        ++res;
    }
    return res;
}