#3710

Maximum Partition Factor

international master · 1960 · lc hard +32 · 31.1% accepted · 78 likes · top 9%

Description

Given a 2D integer array points of Cartesian coordinates, partition all n points into exactly two non-empty groups and return the maximum possible partition factor, where the partition factor is the minimum Manhattan distance between any two points in the same group.

Code

1

2

3

class Solution:
    def maxPartitionFactor(self, points: List[List[int]]) -> int:

class Solution:
    def maxPartitionFactor(self, points: List[List[int]]) -> int: