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…

描述

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 the largest element. 10 is the smallest. 20 is the second smallest. 30 is the third smallest.	

  
 
  1
  2
  3

Example 2:

Input: arr = [100,100,100]
Output: [1,1,1]
Explanation: Same elements share the same rank.

  
 
  1
  2
  3

Example 3:

Input: arr = [37,12,28,9,100,56,80,5,12]
Output: [5,3,4,2,8,6,7,1,3]

  
 
  1
  2

Note:

0 <= arr.length <= 10^5
-10^9 <= arr[i] <= 10^9

  
 
  1
  2

解析

根据题意，就是找到 arr 中各个元素从小到大的顺序，从 1 开始计数，相等的数字序号得一样。思路简单，就是先对去重后的 arr 中的每个数字从小到大编号，最后遍历 arr ，将对应的元素的编号追加到列表中返回即可。

解答

class Solution(object): def arrayRankTransform(self, arr): """ :type arr: List[int] :rtype: List[int] """ tmp = list(set(arr)) tmp.sort() print(tmp) d = {c:i + 1 for i, c in enumerate(tmp)} return [d[c] for c in arr]

  
 
  1
  2
  3
  4
  5
  6
  7
  8
  9
  10
  11

运行结果

Runtime: 320 ms, faster than 73.78% of Python online submissions for Rank Transform of an Array.
Memory Usage: 32.1 MB, less than 79.27% of Python online submissions for Rank Transform of an Array.

  
 
  1
  2