OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

documentation added, testing yet to be added

Browse Source
This commit is contained in:
Rakshaa Viswanathan 2020-09-04 11:16:15 +05:30 committed by GitHub
parent 79e9444802
commit 759313d0ce
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
greedy_algorithms/jumpgame.cpp
View File

@ -6,10 +6,6 @@
* This solution takes in input as a vector and output as a boolean to check if you can reach the last position. * This solution takes in input as a vector and output as a boolean to check if you can reach the last position.
* @author [Rakshaa Viswanathan](https://github.com/rakshaa2000) * @author [Rakshaa Viswanathan](https://github.com/rakshaa2000)
*/ */
//Jump Game:
/*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.*/
#include <vector> #include <vector>
#include<iostream> #include<iostream>
@ -22,6 +18,11 @@ Determine if you are able to reach the last index.*/
*If yes, then that is the last position you can reach starting from the back. *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. *After the end of the loop, if we reach the lastPos as 0, then the destination can be reached from the start position.
*/ */
/**
* This function implements the above algorithm
* @param vector of nums containing the maximum jump (in steps) from that index
* @return returns bool value whether final index can be reached or not
*/
bool canJump(std::vector<int> nums) { bool canJump(std::vector<int> nums) {
auto lastPos = nums.size() - 1; auto lastPos = nums.size() - 1;
for (auto i = nums.size() - 1; i >= 0; i--) { for (auto i = nums.size() - 1; i >= 0; i--) {