华为2018年4月实习笔试题1 字符串排序

类似

输入eeffffgghhhhh
输出efghefghfhfhh 

时间有限，所以暴力解题了

代码如下：

package cn.wubowei.Demo0;

import java.util.ArrayList;

import java.util.Scanner;

public class test1 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        StringBuffer sbuffer=new StringBuffer();
        ArrayList<String> e_arry = new ArrayList<String>();
        ArrayList<String> f_arry = new ArrayList<String>();
        ArrayList<String> g_arry = new ArrayList<String>();
        ArrayList<String> h_arry = new ArrayList<String>();
    
        for (int i = 0; i < s.length(); i++) {
            if (s.charAt(i) == 'e') {
                e_arry.add(String.valueOf(s.charAt(i)));
            } else if (s.charAt(i) == 'f') {
        
                f_arry.add(String.valueOf(s.charAt(i)));
            } else if (s.charAt(i) == 'g') {
    
                g_arry.add(String.valueOf(s.charAt(i)));
            } else if (s.charAt(i) == 'h') {
            
                h_arry.add(String.valueOf(s.charAt(i)));
            }
        }
        int jmax = Math.max((e_arry.size() > f_arry.size() ? 
                     (e_arry.size() > g_arry.size() ? e_arry.size() :g_arry.size())
                  : (f_arry.size() > g_arry.size() ? f_arry.size() : g_arry.size())), 
                     h_arry.size());

        for (int j = 0; j < jmax; j++) {
            if (j < e_arry.size()) {
                sbuffer.append(e_arry.get(j));
            } 
            if (j < f_arry.size()) {
                sbuffer.append(f_arry.get(j));
            } 
            if (j < g_arry.size()) {
                sbuffer.append(g_arry.get(j));
            } 
            if (j < h_arry.size()) {
                sbuffer.append(h_arry.get(j));
            }
            
        }
        
        System.out.println(sbuffer);
    }
}