diff options
| author | crupest <crupest@outlook.com> | 2020-08-15 14:44:22 +0800 |
|---|---|---|
| committer | crupest <crupest@outlook.com> | 2020-08-15 14:44:22 +0800 |
| commit | e027c0c482539aa0e272083f056d2d053746c390 (patch) | |
| tree | 6b7b1838d6ecc7fe67e9127186e8ebe2c0600eb3 | |
| parent | d27007746e01fda55f4abc2cb49e46f319a8f0ba (diff) | |
| download | solutions-e027c0c482539aa0e272083f056d2d053746c390.tar.gz solutions-e027c0c482539aa0e272083f056d2d053746c390.tar.bz2 solutions-e027c0c482539aa0e272083f056d2d053746c390.zip | |
Add problem 55 .
| -rw-r--r-- | cpp/55.cpp | 29 |
1 files changed, 29 insertions, 0 deletions
diff --git a/cpp/55.cpp b/cpp/55.cpp new file mode 100644 index 0000000..d2c2600 --- /dev/null +++ b/cpp/55.cpp @@ -0,0 +1,29 @@ +#include <vector>
+
+using std::vector;
+
+#include <algorithm>
+
+class Solution
+{
+public:
+ bool canJump(vector<int> &nums)
+ {
+ int max = 0;
+ const int size = nums.size();
+ for (int i = 0; i < size; i++)
+ {
+ if (i <= max)
+ {
+ max = std::max(max, i + nums[i]);
+ if (max >= size - 1)
+ return true;
+ }
+ else
+ {
+ return false;
+ }
+ }
+ return false;
+ }
+};
\ No newline at end of file |