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
- 편스토랑
- Git
- 우분투
- 데이콘
- 프로그래머스
- 프로그래머스 파이썬
- 맥북
- leetcode
- Real or Not? NLP with Disaster Tweets
- programmers
- PYTHON
- 더현대서울 맛집
- 캐치카페
- ChatGPT
- AI 경진대회
- Docker
- 백준
- Kaggle
- dacon
- Baekjoon
- gs25
- SW Expert Academy
- 코로나19
- github
- 편스토랑 우승상품
- 파이썬
- ubuntu
- hackerrank
- 금융문자분석경진대회
- 자연어처리
Archives
- Today
- Total
목록
반응형
1331. Rank Transform of an Array (1)
반응형
솜씨좋은장씨
[leetCode] 1331. Rank Transform of an Array (Python)
Given an array of integers arr, replace each element with its rank. The rank represents how large the element is. The rank has the following rules: Rank is an integer starting from 1. The larger the element, the larger the rank. If two elements are equal, their rank must be the same. Rank should be as small as possible. Example 1: Input: arr = [40,10,20,30] Output: [4,1,2,3] Explanation: 40 is t..
Programming/코딩 1일 1문제
2020. 9. 8. 00:15
반응형