-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRankTransformOfArray.php
More file actions
53 lines (51 loc) · 1.37 KB
/
Copy pathRankTransformOfArray.php
File metadata and controls
53 lines (51 loc) · 1.37 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
<?php
namespace App;
/**
* 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]
*
* https://leetcode.com/problems/rank-transform-of-an-array/description
*/
class RankTransformOfArray
{
/**
* @param int[] $arr
* @return int[]
*/
public function arrayRankTransform(array $arr): array
{
$sorted = $arr;
sort($sorted);
$ranks = [];
$rank = 1;
foreach ($sorted as $value) {
if (!isset($ranks[$value])) {
$ranks[$value] = $rank++;
}
}
$result = [];
foreach ($arr as $value) {
$result[] = $ranks[$value];
}
return $result;
}
}