Notice
Recent Posts
Recent Comments
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | 6 | |
7 | 8 | 9 | 10 | 11 | 12 | 13 |
14 | 15 | 16 | 17 | 18 | 19 | 20 |
21 | 22 | 23 | 24 | 25 | 26 | 27 |
28 | 29 | 30 |
Tags
- ChatGPT
- PYTHON
- Real or Not? NLP with Disaster Tweets
- gs25
- 금융문자분석경진대회
- leetcode
- Docker
- 우분투
- hackerrank
- github
- 맥북
- programmers
- 파이썬
- 편스토랑 우승상품
- AI 경진대회
- Baekjoon
- ubuntu
- SW Expert Academy
- 더현대서울 맛집
- 코로나19
- 프로그래머스
- 캐치카페
- Git
- 자연어처리
- 프로그래머스 파이썬
- 데이콘
- 백준
- dacon
- Kaggle
- 편스토랑
Archives
- Today
- Total
솜씨좋은장씨
[leetCode] 1539. Kth Missing Positive Number (Python) 본문
Programming/코딩 1일 1문제
[leetCode] 1539. Kth Missing Positive Number (Python)
솜씨좋은장씨 2020. 12. 27. 22:52728x90
반응형
Given an array arr of positive integers sorted in a strictly increasing order, and an integer k.
Find the kth positive integer that is missing from this array.
Example 1:
Input: arr = [2,3,4,7,11], k = 5
Output: 9
Explanation: The missing positive integers are [1,5,6,8,9,10,12,13,...]. The 5th missing positive integer is 9.
Example 2:
Input: arr = [1,2,3,4], k = 2
Output: 6
Explanation: The missing positive integers are [5,6,7,...]. The 2nd missing positive integer is 6.
Constraints:
- 1 <= arr.length <= 1000
- 1 <= arr[i] <= 1000
- 1 <= k <= 1000
- arr[i] < arr[j] for 1 <= i < j <= arr.length
Solution
class Solution:
def findKthPositive(self, arr: List[int], k: int) -> int:
range_list = set(range(1, max(arr) + k + 1))
set_list = range_list - set(arr)
set_list = sorted(list(set_list))
return list(set_list)[k-1]
'Programming > 코딩 1일 1문제' 카테고리의 다른 글
[leetCode] 1491. Average Salary Excluding the Minimum and Maximum Salary (Python) (0) | 2020.12.29 |
---|---|
[leetCode] 1523. Count Odd Numbers in an Interval Range (Python) (0) | 2020.12.28 |
[leetCode] 92. Reverse Linked List II (Python) (0) | 2020.12.26 |
[Programmers] 최고의 집합 (Python) (0) | 2020.12.22 |
[Programmers] 이상한 문자 만들기 (Python) (0) | 2020.12.19 |
Comments