package com.offer;
/**
* @author kankan
* @creater 2019-05-09 20:43
*/
public class Solution2 {
public static void main(String[] args) {
StringBuffer str = new StringBuffer("We Are Happy.");
System.out.println(str);
String newStr = new Solution2().replaceSpace1(str);
String newStr1 = new Solution2().replaceSpace(str);
System.out.println(newStr);
System.out.println(newStr1);
}
private String replaceSpace1(StringBuffer str) {
if (null == str || 0>= str.length()){
return null;
}
int originLength = str.length();//字符串原长度
int spaceCount = 0;
char[] chars = str.toString().toCharArray();
for (int i = 0; i < originLength; i++) {
if (chars[i] == ' '){
spaceCount++;
}
}
int newLength = originLength + 2 * spaceCount;//替换以后的字符串长度
char[] temp = new char[newLength];//建立一个临时数组
int i = originLength - 1;
int j = newLength - 1;
while (i >= 0){
if (chars[i] == ' '){
temp[j] = '0';
temp[j-1]='2';
temp[j-2]='%';
j=j-3;//替换成功,将索引往前移动三位
}else{
temp[j] = chars[i];//逐个把它指向的字符复制到临时数组中
j = j - 1;
}
i=i-1;//往前移动一位
}
return new String(temp);
}
//
private String replaceSpace(StringBuffer str) {
if (null == str){
return null;
}
//从某处开始的索引
int fromIndex = 0;
int index = 0;
StringBuffer temp = new StringBuffer();
while (index <= str.length()){
//从指定的索引处开始,返回第一次出现的指定子字符串在该字符串中的索引
index = str.indexOf(" ",fromIndex);
if (index >= 0){
//找到一个空格
//subSequence(fromIndex,index)-返回一个新的字符序列,该字符序列是此序列的子序列
temp.append(str.subSequence(fromIndex,index)).append("%20");
index = index + 1;
fromIndex = index;
}else {
//返回一个新的 String,它包含此序列当前所包含的字符子序列
temp.append(str.substring(fromIndex,str.length()));//没找到就把fromIndex后的字符复制到temp
break;
}
}
return temp.toString();
}
}
剑指offer-02-替换空格
最新推荐文章于 2020-09-10 01:04:47 发布