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
- hackerrank
- dacon
- SW Expert Academy
- 금융문자분석경진대회
- 편스토랑
- Docker
- 파이썬
- 코로나19
- ubuntu
- Baekjoon
- 프로그래머스 파이썬
- Real or Not? NLP with Disaster Tweets
- 더현대서울 맛집
- gs25
- Git
- 자연어처리
- PYTHON
- 맥북
- programmers
- leetcode
- 캐치카페
- Kaggle
- github
- AI 경진대회
- 백준
- 프로그래머스
- 편스토랑 우승상품
- ChatGPT
- 우분투
- 데이콘
Archives
- Today
- Total
목록
반응형
448. Find All Numbers Disappeared in an Array (1)
반응형
솜씨좋은장씨
[leetCode] 448. Find All Numbers Disappeared in an Array (Python)
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Find all the elements of [1, n] inclusive that do not appear in this array. Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space. Example: Input: [4,3,2,7,8,2,3,1] Output: [5,6] Solution class Solution: def findDi..
Programming/코딩 1일 1문제
2020. 8. 6. 22:08
반응형