1256. Rank Transform Of An Array¶

LeetCode Problem View on GitHub

1256. Rank Transform of an Array

Easy

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.

Example 2:

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

Example 3:

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

Constraints:

• 0 <= arr.length <= 105
• -109 <= arr[i] <= 109

Solution¶

class Solution {
    public int[] arrayRankTransform(int[] arr) {
        int n = arr.length;
        HashMap<Integer,Integer> map = new HashMap<>();
        int[] ans = new int[n];
        for(int i = 0;i < n; i++) ans[i] = arr[i];
        Arrays.sort(ans);
        int y = 1;
        for(int i = 0;i < n; i++){
            if(!map.containsKey(ans[i])){
                map.put(ans[i], y);
                y++;
            }
        }
        int[] answer = new int[n];
        int k = 0;
        for(int i = 0;i < n; i++){
            int x = map.get(arr[i]);
            answer[k] = x;
            k++;
        }
        return answer;
    }
}

Complexity Analysis¶

• Time Complexity: O(?)
• Space Complexity: O(?)

Approach¶

Detailed explanation of the approach will be added here