test pass

exercises/chenguangjian/简单/数组排序/solution.java

-class Solution {
-    public int[] frequencySort(int[] nums) {
+
+
+ 
+import java.util.Scanner;
+
+import java.util.*;
+import java.util.Arrays;
+ 
+ 
+class Main {
+    
+    public static void main(String[] args) {
+    
+        // 控制台输入
+        Scanner scanner = new Scanner(System.in);
+        String numsStr = scanner.nextLine();
+      
+        int[] nums = new int[]{};
+        // 解析字符串，构造数组
+        numsStr = numsStr.replaceAll(" ","");
+        
+        if(!"[]".equals(numsStr)){
+            String[] numsStrArr = numsStr.replaceAll("\\[", "").replaceAll("\\]", "").split("\\,");
+            nums = new int[numsStrArr.length];
+            for (int i = 0; i < numsStrArr.length; i++) {
+                nums[i] = Integer.parseInt(numsStrArr[i].trim());
+            }
+        }
+        
+        scanner.close();
+        // 调用方法
+        int[] res = frequencySort(nums);
+        // 输出结果
+        System.out.println(Arrays.toString(res));
+    }
+   
+    
+    public static int[] frequencySort(int[] nums) {
         Map<Integer, Integer> cnt = new HashMap<Integer, Integer>();
         for (int num : nums) {
             cnt.put(num, cnt.getOrDefault(num, 0) + 1);
@@ -18,4 +54,6 @@ class Solution {
         }
         return nums;
     }
+        
+    
 }