https://leetcode.com/problems/subrectangle-queries/
#2. answer
answer: F
Popular posts from this blog
Solve a maze of 0s and 1s in python
My 1st exhausting attempt # -*- coding: utf-8 -*- """ Created on Thu Nov 7 01:02:47 2019 @author: chella """ maze=[[1 , 0 , 1 , 1 , 0 , 1], [1 , 1 , 0 , 0 , 0 , 0], [0 , 1 , 0 , 1 , 1 , 1], [0 , 1 , 1 , 1 , 0 , 1], [1 , 0 , 0 , 1 , 1 , 1], [1 , 1 , 0 , 0 , 0 , 1], [0 , 0 , 1 , 1 , 0 , 1]] #This is perfected class vertices: def __init__(self,node): self.node=node self.index=-1 self.edge_list=[] self.distance = -1 # shortest distance from source node in shortest path search self.previous = None def getNeighbors(self): return self.edge_list ...
#1. answer
Comments
Post a Comment