feat: add solutions to lc problem: No.0506.Relative Ranks

Author: yanglbme

solution/0500-0599/0506.Relative Ranks/README.md

@@ -25,7 +25,6 @@
 	<li>所有运动员的成绩都不相同。</li>
 </ol>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
@@ -37,15 +36,52 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def findRelativeRanks(self, score: List[int]) -> List[str]:
+        n = len(score)
+        idx = list(range(n))
+        idx.sort(key=lambda x: -score[x])
+        res = [None] * n
+        for i in range(n):
+            if i == 0:
+                res[idx[i]] = 'Gold Medal'
+            elif i == 1:
+                res[idx[i]] = 'Silver Medal'
+            elif i == 2:
+                res[idx[i]] = 'Bronze Medal'
+            else:
+                res[idx[i]] = str(i + 1)
+        return res
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public String[] findRelativeRanks(int[] nums) {
+        int n = nums.length;
+        Integer[] index = new Integer[n];
+        for (int i = 0; i < n; ++i) {
+            index[i] = i;
+        }
+        Arrays.sort(index, (o1, o2) -> Integer.compare(nums[o2], nums[o1]));
+        String[] res = new String[n];
+        for (int i = 0; i < n; ++i) {
+            if (i == 0) {
+                res[index[i]] = "Gold Medal";
+            } else if (i == 1) {
+                res[index[i]] = "Silver Medal";
+            } else if (i == 2) {
+                res[index[i]] = "Bronze Medal";
+            } else {
+                res[index[i]] = String.valueOf(i + 1);
+            }
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**

solution/0500-0599/0506.Relative Ranks/README_EN.md

@@ -52,13 +52,50 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def findRelativeRanks(self, score: List[int]) -> List[str]:
+        n = len(score)
+        idx = list(range(n))
+        idx.sort(key=lambda x: -score[x])
+        res = [None] * n
+        for i in range(n):
+            if i == 0:
+                res[idx[i]] = 'Gold Medal'
+            elif i == 1:
+                res[idx[i]] = 'Silver Medal'
+            elif i == 2:
+                res[idx[i]] = 'Bronze Medal'
+            else:
+                res[idx[i]] = str(i + 1)
+        return res
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public String[] findRelativeRanks(int[] nums) {
+        int n = nums.length;
+        Integer[] index = new Integer[n];
+        for (int i = 0; i < n; ++i) {
+            index[i] = i;
+        }
+        Arrays.sort(index, (o1, o2) -> Integer.compare(nums[o2], nums[o1]));
+        String[] res = new String[n];
+        for (int i = 0; i < n; ++i) {
+            if (i == 0) {
+                res[index[i]] = "Gold Medal";
+            } else if (i == 1) {
+                res[index[i]] = "Silver Medal";
+            } else if (i == 2) {
+                res[index[i]] = "Bronze Medal";
+            } else {
+                res[index[i]] = String.valueOf(i + 1);
+            }
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**

solution/0500-0599/0506.Relative Ranks/Solution.py

@@ -0,0 +1,16 @@
+class Solution:
+    def findRelativeRanks(self, score: List[int]) -> List[str]:
+        n = len(score)
+        idx = list(range(n))
+        idx.sort(key=lambda x: -score[x])
+        res = [None] * n
+        for i in range(n):
+            if i == 0:
+                res[idx[i]] = 'Gold Medal'
+            elif i == 1:
+                res[idx[i]] = 'Silver Medal'
+            elif i == 2:
+                res[idx[i]] = 'Bronze Medal'
+            else:
+                res[idx[i]] = str(i + 1)
+        return res