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
- Baekjoon
- dacon
- programmers
- 편스토랑 우승상품
- ubuntu
- SW Expert Academy
- hackerrank
- 캐치카페
- Kaggle
- AI 경진대회
- 프로그래머스 파이썬
- 맥북
- 더현대서울 맛집
- 금융문자분석경진대회
- 코로나19
- 우분투
- Git
- Docker
- Real or Not? NLP with Disaster Tweets
- 자연어처리
- 프로그래머스
- 파이썬
- 편스토랑
- gs25
- 데이콘
- 백준
- leetcode
- github
- PYTHON
- ChatGPT
Archives
- Today
- Total
목록
반응형
1356. Sort Integers by The Number of 1 Bits (1)
반응형
솜씨좋은장씨
[leetCode] 1356. Sort Integers by The Number of 1 Bits (Python)
Given an integer array arr. You have to sort the integers in the array in ascending order by the number of 1's in their binary representation and in case of two or more integers have the same number of 1's you have to sort them in ascending order. Return the sorted array. Example 1: Input: arr = [0,1,2,3,4,5,6,7,8] Output: [0,1,2,4,8,3,5,6,7] Explantion: [0] is the only integer with 0 bits. [1,2..
Programming/코딩 1일 1문제
2020. 9. 16. 00:41
반응형