add python solution for problem 55

Author: SysSn13

README.md

@@ -360,7 +360,7 @@ LeetCode
 |58|[Length of Last Word](https://leetcode.com/problems/length-of-last-word/)| [C++](./algorithms/cpp/lengthOfLastWord/lengthOfLastWord.cpp), [Java](./algorithms/java/src/lengthOfLastWord/LengthOfLastWord.java)|Easy|
 |57|[Insert Interval](https://leetcode.com/problems/insert-interval/)| [C++](./algorithms/cpp/insertInterval/insertInterval.cpp)|Hard|
 |56|[Merge Intervals](https://leetcode.com/problems/merge-intervals/)| [C++](./algorithms/cpp/mergeIntervals/mergeIntervals.cpp)|Hard|
-|55|[Jump Game](https://leetcode.com/problems/jump-game/)| [C++](./algorithms/cpp/jumpGame/jumpGame.cpp)|Medium|
+|55|[Jump Game](https://leetcode.com/problems/jump-game/)| [C++](./algorithms/cpp/jumpGame/jumpGame.cpp), [Python](./algorithms/python/jumpGame/jumpGame.py)|Medium|
 |54|[Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)| [C++](./algorithms/cpp/spiralMatrix/spiralMatrix.cpp)|Medium|
 |53|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)| [C++](./algorithms/cpp/maximumSubArray/maximumSubArray.cpp)|Medium|
 |52|[N-Queens II](https://leetcode.com/problems/n-queens-ii/)| [C++](./algorithms/cpp/nQueens/nQueuens.II.cpp)|Hard|
@@ -433,4 +433,3 @@ LeetCode
 |---| ----- | -------- | ---------- |
 |1|[Search in a big sorted array](http://www.lintcode.com/en/problem/search-in-a-big-sorted-array/)|[Java](./algorithms/java/src/searchInABigSortedArray/searchInABigSortedArray.java)|Medium|
 |2|[Search Range in Binary Search Tree](http://www.lintcode.com/en/problem/search-range-in-binary-search-tree/) | [Java](./algorithms/java/src/searchRangeInBinarySearchTree/searchRangeInBinarySearchTree.java)|Medium|
-

algorithms/python/jumpGame/jumpGame.py

@@ -0,0 +1,30 @@
+# Source : https://leetcode.com/problems/jump-game/
+# Author : Sudesh Chaudhary
+# Date   : 2020-10-01
+
+#  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.
+
+#  For example:
+#  A = [2,3,1,1,4], return true.
+
+#  A = [3,2,1,0,4], return false.
+
+
+# Solution
+# time O(n) space O(1)
+
+# traverse array, maintain the most far we can go
+class Solution:
+    def canJump(self, nums: List[int]) -> bool:
+        n = len(nums)
+        # max index where we can go
+        farest = 0;
+        for i in range(n):
+            if i > farest:
+                return False
+            farest = max(farest, i + nums[i])
+        return True