2016阿里巴巴笔试编程题用java和js 实现形如dssd-sdssd 转换成 DssdSdssd

/**
* 将形如dssd-sdssd 转换成 DssdSdssd
* @Description:TODO
* @param str
* @return
* @return:String
* @methodName:firstToHiger
*/
//java第一种实现方式
private static String firstToHiger(String str) {
String[] strArray = str.split("-");
StringBuilder strBuild = new StringBuilder();
for (int i = 0; i < strArray.length; i++) {
char firstChar = str.charAt(0);
if (firstChar > 'a' && firstChar < 'A') {
firstChar = Character.toUpperCase(firstChar);
String notFirstStr = strArray[i].substring(1);
strArray[i] = new StringBuilder().append(firstChar).append(notFirstStr).toString();
}
strBuild.append(strArray[i]);
}
return strBuild.toString();
}
//java第二种实现方式（Character实现）
private static String firstToHiger2(String str) {
String[] strArray = str.split("-");
StringBuilder strBuild = new StringBuilder();
for (int i = 0; i < strArray.length; i++) {
char firtChar = str.charAt(0);
char temp = 0;
if (Character.isLowerCase(firtChar)) {
temp = Character.toUpperCase(firtChar);
}
strArray[i] = strArray[i].replaceFirst(String.valueOf(firtChar),String.valueOf(temp));   //这里 char 转换成 String 
strBuild.append(strArray[i]);
}
return strBuild.toString();
}
//java第三种实现方式（StringBuilder重新组合成新的字符串）
private static String firstToHiger3(String str) {
String[] strArray = str.split("-");
StringBuilder strBuild = new StringBuilder();
for (int i = 0; i < strArray.length; i++) {
strBuild.append(strArray[i].substring(0,1).toUpperCase());
strBuild.append(strArray[i].substring(1));
}
return strBuild.toString();
}
//java第四种实现方式（StringBuilder重新组合成新的字符串，char从小写到大写-32）
private static String firstToHiger4(String str) {
String[] strArray = str.split("-");
StringBuilder strBuild = new StringBuilder();
for (int i = 0; i < strArray.length; i++) {
char char0 = strArray[i].charAt(0);
if (char0 > 'a' && char0 < 'z') {
char s0 = (char) (strArray[i].charAt(0) - 32);  //可以是 32 = 'a' - 'A'
strBuild.append(s0);
strBuild.append(strArray[i].substring(1));
}else{
strBuild.append(strArray[i]);
}
}
return strBuild.toString();
}

//用js实现：
function firstToHiger(str){
var array = str.split("-");
var strTemp = "";
for(var i in array){
var word = array[i];
// strTemp += word.substring(0,1).toUpperCase( ) + word.substring(1);   
strTemp += word.slice(0,1).toUpperCase( ) + word.slice(1);  //更加灵活点对负数进行了处理， 获取被截取的字符串
}
return strTemp;
}
console.log(firstToHiger("abcdefd-Adbhbj"));