Wrong test case?


  • 0
    A

    Given input "[[0,0,1,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0],[1,0,0,0,0,0,0,0,0,1,0,0,1,1,0,0,0,0,0],[0,0,0,1,0,0,0,1,0,0,0,0,0,0,1,1,1,0,0],[1,0,0,0,1,1,1,1,0,0,1,0,0,1,0,0,0,0,0],[1,1,1,0,1,1,0,0,1,0,0,0,1,0,0,0,1,0,0],[0,0,0,1,1,1,0,1,0,0,0,0,1,1,0,0,1,0,0]]",
    the best meeting location is 4, 8 with a shortest distance of 151.


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.