Class Solution
java.lang.Object
g1301_1400.s1331_rank_transform_of_an_array.Solution
1331 - Rank Transform of an Array.<p>Easy</p>
<p>Given an array of integers <code>arr</code>, replace each element with its rank.</p>
<p>The rank represents how large the element is. The rank has the following rules:</p>
<ul>
<li>Rank is an integer starting from 1.</li>
<li>The larger the element, the larger the rank. If two elements are equal, their rank must be the same.</li>
<li>Rank should be as small as possible.</li>
</ul>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> arr = [40,10,20,30]</p>
<p><strong>Output:</strong> [4,1,2,3]</p>
<p><strong>Explanation:</strong> 40 is the largest element. 10 is the smallest. 20 is the second smallest. 30 is the third smallest.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> arr = [100,100,100]</p>
<p><strong>Output:</strong> [1,1,1]</p>
<p><strong>Explanation:</strong> Same elements share the same rank.</p>
<p><strong>Example 3:</strong></p>
<p><strong>Input:</strong> arr = [37,12,28,9,100,56,80,5,12]</p>
<p><strong>Output:</strong> [5,3,4,2,8,6,7,1,3]</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>0 <= arr.length <= 10<sup>5</sup></code></li>
<li><code>-10<sup>9</sup> <= arr[i] <= 10<sup>9</sup></code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
arrayRankTransform
public int[] arrayRankTransform(int[] arr)
-