feat: add solutions to lc problem: No.1331

Author: rain84

solution/1300-1399/1331.Rank Transform of an Array/README.md

@@ -183,4 +183,46 @@ function arrayRankTransform(arr: number[]): number[] {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2: Sorting + Hash Map
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function arrayRankTransform(arr: number[]): number[] {
+    const sorted = [...new Set(arr)].sort((a, b) => a - b);
+    const map = new Map<number, number>();
+    let c = 1;
+
+    for (const x of sorted) {
+        map.set(x, c++);
+    }
+
+    return arr.map(x => map.get(x)!);
+}
+```
+
+#### JavaScript
+
+```js
+function arrayRankTransform(arr) {
+    const sorted = [...new Set(arr)].sort((a, b) => a - b);
+    const map = new Map();
+    let c = 1;
+
+    for (const x of sorted) {
+        map.set(x, c++);
+    }
+
+    return arr.map(x => map.get(x));
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/1300-1399/1331.Rank Transform of an Array/README_EN.md

@@ -184,4 +184,46 @@ function arrayRankTransform(arr: number[]): number[] {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2: Sorting + Hash Map
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function arrayRankTransform(arr: number[]): number[] {
+    const sorted = [...new Set(arr)].sort((a, b) => a - b);
+    const map = new Map<number, number>();
+    let c = 1;
+
+    for (const x of sorted) {
+        map.set(x, c++);
+    }
+
+    return arr.map(x => map.get(x)!);
+}
+```
+
+#### JavaScript
+
+```js
+function arrayRankTransform(arr) {
+    const sorted = [...new Set(arr)].sort((a, b) => a - b);
+    const map = new Map();
+    let c = 1;
+
+    for (const x of sorted) {
+        map.set(x, c++);
+    }
+
+    return arr.map(x => map.get(x));
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/1300-1399/1331.Rank Transform of an Array/Solution2.js

@@ -0,0 +1,11 @@
+function arrayRankTransform(arr) {
+    const sorted = [...new Set(arr)].sort((a, b) => a - b);
+    const map = new Map();
+    let c = 1;
+
+    for (const x of sorted) {
+        map.set(x, c++);
+    }
+
+    return arr.map(x => map.get(x));
+}

solution/1300-1399/1331.Rank Transform of an Array/Solution2.ts

@@ -0,0 +1,11 @@
+function arrayRankTransform(arr: number[]): number[] {
+    const sorted = [...new Set(arr)].sort((a, b) => a - b);
+    const map = new Map<number, number>();
+    let c = 1;
+
+    for (const x of sorted) {
+        map.set(x, c++);
+    }
+
+    return arr.map(x => map.get(x)!);
+}