diff --git "a/leetcode3/\354\206\241\354\243\274\355\230\234/1802. Maximum Value at a Given Index in a Bounded Array" "b/leetcode3/\354\206\241\354\243\274\355\230\234/1802. Maximum Value at a Given Index in a Bounded Array" new file mode 100644 index 00000000..aba09de3 --- /dev/null +++ "b/leetcode3/\354\206\241\354\243\274\355\230\234/1802. Maximum Value at a Given Index in a Bounded Array" @@ -0,0 +1,20 @@ +class Solution: + def maxValue(self, n: int, index: int, maxSum: int) -> int: + numbers = [1] * n + tmp = maxSum - n # 남은거 + left = index + right = index + + while True: + value = right - left + 1 # 개수 + if tmp < value: + break + + for i in range(left, right + 1): + numbers[i] += 1 + tmp -= value + + print(tmp, value) + + + diff --git "a/leetcode3/\354\206\241\354\243\274\355\230\234/1828. Queries on Number of Points Inside a Circle" "b/leetcode3/\354\206\241\354\243\274\355\230\234/1828. Queries on Number of Points Inside a Circle" new file mode 100644 index 00000000..b1b4cc6a --- /dev/null +++ "b/leetcode3/\354\206\241\354\243\274\355\230\234/1828. Queries on Number of Points Inside a Circle" @@ -0,0 +1,15 @@ +class Solution: + def countPoints(self, points: list[list[int]], queries: list[list[int]]) -> list[int]: + result = [] + + for x, y, r in queries: + cnt = 0 + + for i, j in points: + if (i-x)**2 + (j-y)**2 <= r**2: + cnt +=1 + + result.append(cnt) + return result + + ## 시간복잡도: O(n^2)