# 1331. Rank Transform of an Array ###### tags: `Leetcode` `Easy` `HashMap` Link: https://leetcode.com/problems/rank-transform-of-an-array/ ## Code ```java= class Solution { public int[] arrayRankTransform(int[] arr) { int[] A = Arrays.copyOf(arr, arr.length); Arrays.sort(A); Map<Integer, Integer> rank = new HashMap<>(); for(int num:A) rank.putIfAbsent(num, rank.size()+1); for(int i=0; i<arr.length; i++){ A[i] = rank.get(arr[i]); } return A; } } ```
×
Sign in
Email
Password
Forgot password
or
By clicking below, you agree to our
terms of service
.
Sign in via Facebook
Sign in via Twitter
Sign in via GitHub
Sign in via Dropbox
Sign in with Wallet
Wallet (
)
Connect another wallet
New to HackMD?
Sign up