Re: [閒聊] 每日leetcode

[dont (dont)]

1331. Rank Transform of an Array

## 思路

先用sort過的arr建 num -> rank 的HashTable

再把arr轉成rank

## Code

```python
class Solution:
    def arrayRankTransform(self, arr: List[int]) -> List[int]:
        table = {}
        rank = 1
        for num in sorted(arr):
            if num not in table:
                table[num] = rank
                rank += 1

        return [table[num] for num in arr]
```

--
https://i.imgur.com/kyBhy6o.jpeg

--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 185.213.82.162 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1727832807.A.658.html
推 sustainer123: 大師