面试题总结六:空格替换

package javafirst;

public class Test {
 
public static void main(String[] args) {

String string ="we are null";
System.out.println(replaceBlank(string));
}
 
/**
* 思路:再建立一个辅助数组,从前往后或者从后往前遍历原字符串,同时移动两个指针
* 时间复杂度是O(n)
* 空间复杂度也是O(n)
* @param arr
* @return
*/
private static String replaceBlank(String string) {
if(string==null)
return null;
int originLength = string.length();
int numOfBlank = 0; // 记录空格数
char[] charArray = string.toCharArray();
for (int i = 0; i < charArray.length; i++) {
if(charArray[i]==' ')
numOfBlank++;
}
int newLength = originLength+numOfBlank*2; // 替换后的字符串长度
char[] newcharArray = new char[newLength];
// 分别设置两指针
// 以下是指针从前往后移动
int indexOfOriginal = 0;
int indexOfNew = 0;
while(indexOfOriginal<originLength){
if(charArray[indexOfOriginal]==' '){
newcharArray[indexOfNew++] = '%';
newcharArray[indexOfNew++] = '2';
newcharArray[indexOfNew++] = '0';
indexOfOriginal++;
}else {
newcharArray[indexOfNew++] = charArray[indexOfOriginal++];
}
}
// 以下是指针从后往前移动
/*int indexOfOriginal = originLength-1;
int indexOfNew = newLength-1;
while(indexOfOriginal>=0&&indexOfOriginal<indexOfNew){
if(charArray[indexOfOriginal]==' '){
newcharArray[indexOfNew--] = '0';
newcharArray[indexOfNew--] = '2';
newcharArray[indexOfNew--] = '%';
indexOfOriginal--;
}else {
newcharArray[indexOfNew--] = charArray[indexOfOriginal--];
}
}*/
return String.valueOf(newcharArray);

}
}

猜你喜欢

转载自blog.csdn.net/juleen890/article/details/80861270
今日推荐