MCPcopy Create free account
hub / github.com/HuberTRoy/leetCode / get_up_left

Method get_up_left

Array/MinimumPathSum.py:32–43  ·  view source on GitHub ↗
(self, x, y)

Source from the content-addressed store, hash-verified

30"""
31class Solution(object):
32 def get_up_left(self, x, y):
33 if y-1 < 0:
34 up = False
35 else:
36 up = (x, y-1)
37 if x-1 < 0:
38 left = False
39 else:
40 left = (x-1,y)
41
42 # up and left
43 return (up, left)
44
45 def minPathSum(self, grid):
46 """

Callers 1

minPathSumMethod · 0.95

Calls

no outgoing calls

Tested by

no test coverage detected