今天面试的时候,让写一个算法,题意是将字符串“How are you ?! I'm fine! ”转变为“ !fine I'm !? you are How”,当时这道题并没有做出来,现在记录一下。
/**
* 将字符串进行反转,必须保证单词的正确拼写
* @author Administrator
*
*/
public class TestReserves {
public static void main(String[] args) {
String str = "How are you ?! I'm fine! ";
char[] chars = str.toCharArray();
System.out.println(chars);
resverseStr(chars);
System.out.println(chars);
}
/**
* 转换字符串
* @param chars
*/
public static void resverseStr(char[] chars) {
// 先将字符串进行完全反转 !enif m'I !? uoy era woH
resverseWord(chars, 0, chars.length - 1);
int begin = -1;
int end = 0;
for (int i = 0; i < chars.length; i++) {
char c = chars[i];
if ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '\'') {
if (begin == -1) {
begin = i;
end = i;
} else {
end = i;
if (i == chars.length - 1) {
resverseWord(chars, begin, end);
}
}
} else {
if (begin != -1) {
resverseWord(chars, begin, end);
begin = -1;
end = 0;
}
}
}
}
/**
* 将char数组指定位置的数据进行反转
* @param chars 要反转的char数组
* @param begin 开始位置
* @param end 结束位置
*/
public static void resverseWord(char[] chars, int begin, int end) {
while (end > begin) {
char c = chars[begin];
chars[begin] = chars[end];
chars[end] = c;
begin++;
end--;
}
}
}