easy题目。利用treemap排个序,就这样,thankyou
class Solution {
public String[] reorderLogFiles(String[] logs) {
List<String> digits = new ArrayList<String>() ;
Map<String, String> letters = new TreeMap<>() ;
String[] result = new String[logs.length] ;
for(String log : logs){
String s[] = log.split(" ") ;
if(s[1].charAt(0)>='0'&&s[1].charAt(0)<='9'){
digits.add(log) ;
}else{
String key = log.substring(s[0].length()+1, log.length());
letters.put(key, log) ;
}
}
int k = 0;
for(String s : letters.keySet()){
result[k] = letters.get(s) ;
k++;
}
for(int i=0;i<digits.size();i++){
result[k] = digits.get(i) ;
k++ ;
}
return result ;
}
}