Question: PYTHON 3.6 SOLVE IS PEAK FUNCTION: def is_peak(map, r, c): Given a map and a location, is it land and are all neighboring land spots
PYTHON 3.6
SOLVE IS PEAK FUNCTION:
def is_peak(map, r, c): Given a map and a location, is it land and are all neighboring land spots lower than it? If the spot isn't on the map, it is not a peak. It's possible to have peaks on the border.
is_peak(map2,1,3) True
is_peak(map2,2,3) False
is_peak(map5,3,3) True
SEE PIC FOR REFERENCE FUNCTIONS
def show (map): mystr'' substrings[] max_len max ([len (str(j)) for i in map for j in i]) for i in map: i [' '"(int (max-len)-len(str(j)))+str(j) for j substrings.append( ".join(i)) in i] return " ".join(substrings) +'n' #map 1 is coming from above function def highest_point (map): max=0 row-0 column-0 for r in range(1en (map)): for c in range(1en (map[r])) if map[r][c]>max: max map[r][c] column-c if max 0: return None else: return (row, column) def on_map (map, r, c): if(r)s0 r=0 and and else return False def is_map (map): if(len (map)>0): ssetO for x in range(len(map)): s.add (len (map[x])) for y in map[x]: if (not isinstance(y, int)): return False elif(yc0): return False if(len (s) 1): return True else: return False else return False def show (map): mystr'' substrings[] max_len max ([len (str(j)) for i in map for j in i]) for i in map: i [' '"(int (max-len)-len(str(j)))+str(j) for j substrings.append( ".join(i)) in i] return " ".join(substrings) +'n' #map 1 is coming from above function def highest_point (map): max=0 row-0 column-0 for r in range(1en (map)): for c in range(1en (map[r])) if map[r][c]>max: max map[r][c] column-c if max 0: return None else: return (row, column) def on_map (map, r, c): if(r)s0 r=0 and and else return False def is_map (map): if(len (map)>0): ssetO for x in range(len(map)): s.add (len (map[x])) for y in map[x]: if (not isinstance(y, int)): return False elif(yc0): return False if(len (s) 1): return True else: return False else return False
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
