1610. Maximum Number of Visible Points

# Time:  O(nlogn)
# Space: O(n)

import math


class Solution(object):
    def visiblePoints(self, points, angle, location):
        """
        :type points: List[List[int]]
        :type angle: int
        :type location: List[int]
        :rtype: int
        """
        arr, extra = [], 0
        for p in points:
            if p == location:
                extra += 1
                continue
            arr.append(math.atan2(p[1]-location[1], p[0]-location[0]))
        arr.sort()
        arr.extend([x + 2.0*math.pi for x in arr])  # make it circular
        d = 2.0*math.pi * (angle/360.0)
        left = result = 0
        for right in xrange(len(arr)):
            while arr[right]-arr[left] > d:
                left += 1
            result = max(result, right-left+1)
        return result + extra

Solution from kamyu104/LeetCode-Solutions · MIT