剑指5 java

czhc1140075663

已于 2022-05-28 10:06:57 修改

阅读量70

点赞数

分类专栏：笔记文章标签： leetcode 动态规划算法

于 2022-05-27 11:11:28 首次发布

本文链接：https://blog.csdn.net/czhc1140075663/article/details/124999745

版权

笔记专栏收录该内容

55 篇文章 0 订阅

订阅专栏

替换空格。字符串中空格替换为%20

*public class Solution{
public static int rePlace(String s){
int length=s.length*3;
Char[] str=new char[length];
for(int i=0;i<length;i++){
if(charAt[i]=' ')
{str[i++]='%';
str[i++]='2';
str[i++]='0';
}else{str[i++]=charAt[i];
}
}int newStr=new char
char(str,0,size)
rertuen newStr;
}
}*

public class Solution{
public static int rePlace(string s){
int length=s.length*3;
char[] str=new char[length];
int size=0;
for(int i=0;i<s.length();i++)
{if(s.charAt(i)==' '){
str[size++]='%';
str[size++]='2';
str[size++]='0';}
else{str[size++]=s.charAt(i);}
}String newStr=new String(str,0,size);
return newStr;
}
}

*public class solution{
public static int rePlace(string s){
int length=s.length*3;
char[] str=new char[length];
int size=0;
for(int i=0;i<s.length();i++)
{if(s.charAt(i)==' '){
str[size++]='%';
str[size++]='2';
str[size++]='0';}
else{str[size++]=s.charAt(i);}
}String newStr=new String(str,0,size);
return newStr;
}
}*