Jumping on the Clouds problem and solution in c++

 There is a new mobile game that starts with consecutively numbered clouds. Some of the clouds are thunderheads and others are cumulus. The player can jump on any cumulus cloud having a number that is equal to the number of the current cloud plus  or . The player must avoid the thunderheads. Determine the minimum number of jumps it will take to jump from the starting postion to the last cloud. It is always possible to win the game.

For each game, you will get an array of clouds numbered  if they are safe or  if they must be avoided.

Example

Index the array from . The number on each cloud is its index in the list so the player must avoid the clouds at indices  and . They could follow these two paths:  or . The first path takes  jumps while the second takes . Return .

Function Description

Complete the jumpingOnClouds function in the editor below.

jumpingOnClouds has the following parameter(s):

• int c[n]: an array of binary integers

Returns

• int: the minimum number of jumps required

Input Format

The first line contains an integer , the total number of clouds. The second line contains  space-separated binary integers describing clouds  where .

Constraints

Output Format

Print the minimum number of jumps needed to win the game.

Sample Input 0

7
0 0 1 0 0 1 0

Sample Output 0

4

Explanation 0:
The player must avoid  and . The game can be won with a minimum of  jumps:

Sample Input 1

6
0 0 0 0 1 0

Sample Output 1

3

Explanation 1:
The only thundercloud to avoid is . The game can be won in  jumps:

Solution:

#include <bits/stdc++.h>

using namespace std;

string ltrim(const string &);

string rtrim(const string &);

vector<string> split(const string &);

/*

 * Complete the 'jumpingOnClouds' function below.

 *

 * The function is expected to return an INTEGER.

 * The function accepts INTEGER_ARRAY c as parameter.

 */

int jumpingOnClouds(vector<int> c) {

  //Conditions

  if((c.size()<2)||(c.size()>100))

   return 0;

   

  

  int len = c.size();

  if((c[0]!=0)&&(c[len-1]!=0))

  return 0;

  

  int jumps=0;

  for(int i=0;i<len-1;){

      if(((c[i]==0)&&(c[i+1]==1))||

      ((c[i]==0)&&(c[i+1]==0)&&(c[i+2]==0))){

        jumps++;

        i=i+2;

      }

      else{

            jumps++;

              i=i+1;

          }

  }

 return jumps;

}

int main()

{

    ofstream fout(getenv("OUTPUT_PATH"));

    string n_temp;

    getline(cin, n_temp);

    int n = stoi(ltrim(rtrim(n_temp)));

    string c_temp_temp;

    getline(cin, c_temp_temp);

    vector<string> c_temp = split(rtrim(c_temp_temp));

    vector<int> c(n);

    for (int i = 0; i < n; i++) {

        int c_item = stoi(c_temp[i]);

        c[i] = c_item;

    }

    int result = jumpingOnClouds(c);

    fout << result << "\n";

    fout.close();

    return 0;

}

string ltrim(const string &str) {

    string s(str);

    s.erase(

        s.begin(),

        find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))

    );

    return s;

}

string rtrim(const string &str) {

    string s(str);

    s.erase(

        find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),

        s.end()

    );

    return s;

}

vector<string> split(const string &str) {

    vector<string> tokens;

    string::size_type start = 0;

    string::size_type end = 0;

    while ((end = str.find(" ", start)) != string::npos) {

        tokens.push_back(str.substr(start, end - start));

        start = end + 1;

    }

    tokens.push_back(str.substr(start));

    return tokens;

}