no message

Author: Partho Biswas

algoexpert.io/python/Min_Number_Of_Jumps.py

@@ -1,13 +1,16 @@
 # Solution #1
 #   O(n^2) time | O(n) space
 def minNumberOfJumps(array):
-    jumps = [float("inf")  for x in array]
-    jumps[0] = 0
-    for i in range(1, len(array)):
-        for j in range(0, i):
-            if array[j] + j >= i :
-                jumps[i] = min(jumps[i], jumps[j] + 1)
-    return jumps[-1]
+	aLen = len(array)
+	if aLen == 1:
+		return 0
+    dp = [float("inf") for _ in range(aLen)]
+	dp[0] = 0
+	for destiinationIdx in range(1, aLen):
+		for sourceIdx in range(0, destiinationIdx):
+			if sourceIdx + array[sourceIdx] >= destiinationIdx:
+				dp[destiinationIdx] = min(dp[destiinationIdx], dp[sourceIdx] + 1)
+	return dp[-1]
 
 # Solution #2
 # O(n) time | O(1) space

algoexpert.io/python/Zigzag_Traverse.py

@@ -7,7 +7,7 @@ def zigzagTraverse(array):
     result = []
     row, col = 0, 0
     goingDown = True
-    while not isOutOfBounds(row, col, height, width):
+    while not isOutOfBound(height, width, row, col):
         result.append(array[row][col])
         if goingDown:
             if col == 0 or row == height:
@@ -20,7 +20,7 @@ def zigzagTraverse(array):
                 row += 1
                 col -= 1
         else:
-            if row == 0 or col == width:
+            if col == width or row == 0:
                 goingDown = True
                 if col == width:
                     row += 1
@@ -29,8 +29,9 @@ def zigzagTraverse(array):
             else:
                 row -= 1
                 col += 1
+
     return result
 
 
-def isOutOfBounds(row, col, height, width):
-    return row < 0 or row > height or col < 0 or col > width
+def isOutOfBound(height, width, row, col):
+    return row < 0 or row > height or col < 0 or col > width