1331 - Rank Transform of an Array

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

C++

• class Solution {
  public:
      vector<int> arrayRankTransform(vector<int>& arr) {
          vector<int> t = arr;
          sort(t.begin(), t.end());
          t.erase(unique(t.begin(), t.end()), t.end());
          vector<int> ans;
          for (int x : arr) {
              ans.push_back(upper_bound(t.begin(), t.end(), x) - t.begin());
          }
          return ans;
      }
  };

PYTHON

• class Solution:
      def arrayRankTransform(self, arr):
          n = len(arr)
          t = sorted(arr)
          rank_map = {}
          m = 1
          
          for i in range(n):
              if t[i] not in rank_map:
                  rank_map[t[i]] = m
                  m += 1
  
          return [rank_map[x] for x in arr]

JAVA

• class Solution {
      public int[] arrayRankTransform(int[] arr) {
          int n = arr.length;
          int[] t = arr.clone();
          Arrays.sort(t);
          int m = 0;
          for (int i = 0; i < n; ++i) {
              if (i == 0 || t[i] != t[i - 1]) {
                  t[m++] = t[i];
              }
          }
          int[] ans = new int[n];
          for (int i = 0; i < n; ++i) {
              ans[i] = Arrays.binarySearch(t, 0, m, arr[i]) + 1;
          }
          return ans;
      }
  }