목록파이썬 알고리즘 풀기 (6)

소프트웨어에 대한 모든 것

LeetCode 풀기 - 1356. Sort Integers by The Number of 1 Bits

1356. Sort Integers by The Number of 1 Bits https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/ Sort Integers by The Number of 1 Bits - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제) 솔루션1) class Solution: def sortByBits(self, arr: List[int]) -> List[int]: d = ..
알고리즘/LeetCode 2021. 12. 29. 20:18
LeetCode 풀기 - 1380. Lucky Numbers in a Matrix

1380. Lucky Numbers in a Matrix https://leetcode.com/problems/lucky-numbers-in-a-matrix/ Lucky Numbers in a Matrix - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제) 솔루션1) class Solution: def luckyNumbers (self, matrix: List[List[int]]) -> List[int]: n_row = len(matrix) n_col = ..
알고리즘/LeetCode 2021. 12. 29. 20:01
LeetCode 풀기 - 973. K Closest Points to Origin

973. K Closest Points to Origin https://leetcode.com/problems/k-closest-points-to-origin/ K Closest Points to Origin - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제) 솔루션1) class Solution: def kClosest(self, points: List[List[int]], k: int) -> List[List[int]]: distances = [] fo..
알고리즘/LeetCode 2021. 12. 26. 13:52
LeetCode 풀기 - 1742. Maximum Number of Balls in a Box

1742. Maximum Number of Balls in a Box https://leetcode.com/problems/maximum-number-of-balls-in-a-box/ Maximum Number of Balls in a Box - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 제목 문제) 솔루션1) class Solution: def countBalls(self, lowLimit: int, highLimit: int) -> int: d = def..
알고리즘/LeetCode 2021. 12. 14. 06:53
LeetCode 풀기 - 2053. Kth Distinct String in an Array

2053. Kth Distinct String in an Array https://leetcode.com/problems/kth-distinct-string-in-an-array/ Kth Distinct String in an Array - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제) 솔루션1) dict 사용 class Solution: def kthDistinct(self, arr: List[str], k: int) -> str: d = {} for ..
알고리즘/LeetCode 2021. 12. 13. 20:40
LeetCode 풀기 - 1413. Minimum Value to Get Positive Step by Step Sum

1413. Minimum Value to Get Positive Step by Step Sum 문제) 솔루션1) class Solution: def minStartValue(self, nums: List[int]) -> int: if nums[0] > 0: start = 1 else: start = abs(nums[0]) + 1 while True: r = start for n in nums: if r+n int: return abs(min(accumulate(nums, initial=0))) + 1
알고리즘/LeetCode 2021. 11. 12. 08:34
Prev 1 Next