jump_game.cpp File Reference

Jumping Game algorithm implementation More...

#include <cassert>
#include <iostream>
#include <vector>

Include dependency graph for jump_game.cpp:

Namespaces
namespace	greedy_algorithms
	for std::vector

Functions
bool	greedy_algorithms::can_jump (const std::vector< int > &nums)
	Checks whether the given element (default is 1) can jump to the last index.
static void	test ()
	Function to test the above algorithm.
int	main ()
	Main function.

Detailed Description

Jumping Game algorithm implementation

Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Determine if you are able to reach the last index. This solution takes in input as a vector and output as a boolean to check if you can reach the last position. We name the indices good and bad based on whether we can reach the destination if we start at that position. We initialize the last index as lastPos. Here, we start from the end of the array and check if we can ever reach the first index. We check if the sum of the index and the maximum jump count given is greater than or equal to the lastPos. If yes, then that is the last position you can reach starting from the back. After the end of the loop, if we reach the lastPos as 0, then the destination can be reached from the start position.

Author

Rakshaa Viswanathan

David Leal

Function Documentation

main()

int main

(

void

)

Main function.

Returns

0 on exit

           {
    test();  // run self-test implementations
    return 0;
}

Here is the call graph for this function:

test()

static void test ( )

static

Function to test the above algorithm.

Returns

void

                   {
    assert(greedy_algorithms::can_jump(std::vector<int>({4, 3, 1, 0, 5})));
    assert(!greedy_algorithms::can_jump(std::vector<int>({3, 2, 1, 0, 4})));
    assert(greedy_algorithms::can_jump(std::vector<int>({5, 9, 4, 7, 15, 3})));
    assert(!greedy_algorithms::can_jump(std::vector<int>({1, 0, 5, 8, 12})));
    assert(greedy_algorithms::can_jump(std::vector<int>({2, 1, 4, 7})));
 
    std::cout << "All tests have successfully passed!\n";
}

Here is the call graph for this function: