Java codestatic String[][] sp(final String[] cs, int tlen) { if (cs == null || tlen < 0) { return null; } String[] c = new String[cs.length]; System.arraycopy(cs, 0, c, 0, c.length); //打乱 Random ran = new Random(); for (int i = c.length; i > 1; i--) { //产生随机数 int r = ran.nextInt(i); //交换 String buf = c[r]; c[r] = c[i - 1]; c[i - 1] = buf; } //分组后的组数 int len = cs.length / tlen; if (cs.length > len * tlen) { len++; } String[][] re = new String[len][]; //分组 for (int i = 0, t = 0; i < cs.length; i += tlen, t++) { int clen; if (i + tlen > cs.length) { clen = cs.length - i; } else { clen = tlen; } String[] cstr = new String[clen]; System.arraycopy(c, i, cstr, 0, clen); re[t] = cstr; } return re; }
------解决方案--------------------------------------------------------Java codepublic List group(String [] str,int m){ List _student = new ArrayList(); for(int i=0;i student = new ArrayList(); for(int i=0;i