lukefleed
/
competitive-programming
mirror of https://github.com/lukefleed/competitive-programming
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
main
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '923502c275'
${ noResults }
competitive-programming/2023_11_09/minimum-number-of-jumps
History
Luca Lombardo 923502c275 new problem 1 year ago
..
src new problem 1 year ago
Cargo.toml new problem 1 year ago
README.md new problem 1 year ago

README.md

The algorithm iterates over the nums vector exactly once. For each element in the nums vector, it performs a constant amount of work - it updates cur_farthest and checks if i is equal to cur_end. If i is equal to cur_end, it increments jumps and updates cur_end. All of these operations take constant time.

Therefore, the time complexity of the algorithm is O(n), where n is the length of the nums vector.