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 |
Tags
- 더현대서울 맛집
- programmers
- Baekjoon
- AI 경진대회
- 맥북
- leetcode
- 편스토랑 우승상품
- 우분투
- ChatGPT
- dacon
- 코로나19
- 프로그래머스 파이썬
- Git
- hackerrank
- github
- 백준
- Real or Not? NLP with Disaster Tweets
- ubuntu
- 자연어처리
- PYTHON
- Kaggle
- 데이콘
- 프로그래머스
- 편스토랑
- gs25
- 파이썬
- Docker
- SW Expert Academy
- 캐치카페
- 금융문자분석경진대회
Archives
- Today
- Total
솜씨좋은장씨
[leetCode] 1356. Sort Integers by The Number of 1 Bits (Python) 본문
Programming/코딩 1일 1문제
[leetCode] 1356. Sort Integers by The Number of 1 Bits (Python)
솜씨좋은장씨 2020. 9. 16. 00:41728x90
반응형
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,4,8] all have 1 bit.
[3,5,6] have 2 bits.
[7] has 3 bits.
The sorted array by bits is [0,1,2,4,8,3,5,6,7]
Example 2:
Input: arr = [1024,512,256,128,64,32,16,8,4,2,1]
Output: [1,2,4,8,16,32,64,128,256,512,1024]
Explantion: All integers have 1 bit in the binary representation, you should just sort them in ascending order.
Example 3:
Input: arr = [10000,10000]
Output: [10000,10000]
Example 4:
Input: arr = [2,3,5,7,11,13,17,19]
Output: [2,3,5,17,7,11,13,19]
Example 5:
Input: arr = [10,100,1000,10000]
Output: [10,100,10000,1000]
Constraints:
- 1 <= arr.length <= 500
- 0 <= arr[i] <= 10^4
Solution
class Solution:
def sortByBits(self, arr: List[int]) -> List[int]:
one_count_dict = {}
for i, num in enumerate(arr):
one_count = bin(num).count("1")
one_count_dict[i] = one_count
sorted_dict = sorted(one_count_dict.items(), key=lambda x:(x[1], arr[x[0]]))
answer = [arr[num[0]] for num in sorted_dict]
return answer
'Programming > 코딩 1일 1문제' 카테고리의 다른 글
[leetCode] 191. Number of 1 Bits (Python) (0) | 2020.09.18 |
---|---|
[leetCode] 705. Design HashSet (Python) (0) | 2020.09.17 |
[leetCode] 1550. Three Consecutive Odds (Python) (0) | 2020.09.15 |
[leetCode] 1365. How Many Numbers Are Smaller Than the Current Number (Python) (2) | 2020.09.14 |
[leetCode] 500. Keyboard Row (Python) (0) | 2020.09.13 |
Comments