字符串连接算法挑战

挑战&＃xff1a;

将字符串转换为 spinal case。Spinal case 是 all-lowercase-words-joined-by-dashes 这种形式的&＃xff0c;也就是以连字符连接所有小写单词。

例如&＃xff1a;

spinalCase("This Is Spinal Tap") 应该返回 "this-is-spinal-tap"。spinalCase("thisIsSpinalTap") 应该返回 "this-is-spinal-tap"。 spinalCase("The_Andy_Griffith_Show") 应该返回 "the-andy-griffith-show"。spinalCase("Teletubbies say Eh-oh") 应该返回 "teletubbies-say-eh-oh"。


答案&＃xff1a;

function spinalCase(str) {
// "It&＃39;s such a fine line between stupid, and clever."
// --David St. Hubbinsstr&＃61;str.replace(/_/g," ");var arr&＃61;str.split(" ");if( arr.length&＃61;&＃61;1 ){str&＃61;str.replace(/([A-Z])/g," $1");}str&＃61;str.trim().toLowerCase().replace(/[\s]/g,"-");return str;
}spinalCase(&＃39;This Is Spinal Tap&＃39;);

运行结果&＃xff1a;

this-is-spinal-tap

在线测试&＃xff1a;

字符串连接算法挑战 | w3cschool