목록1610. Maximum Number of Visible Points (1)

Scribbling

LeetCode: 1610. Maximum Number of Visible Points

class Solution: def visiblePoints(self, points: List[List[int]], angle: int, location: List[int]) -> int: from math import atan2, pi from bisect import bisect_right numLoc = 0 angles = [] for point in points: x, y = point[0] - location[0], point[1] - location[1] if x == 0 and y == 0: numLoc += 1 else: val = atan2(y, x) * 180 / pi if val < 0: val += 360 angles.append(val) angles.sort() angles += ..
Computer Science/Coding Test 2022. 3. 7. 14:29
이전 Prev 1 Next 다음