反转字符串
题目链接
视屏链接
字符串基础操作! | LeetCode:344.反转字符串 (opens new window)
思路:
利用双指针,一个在字符串头部,一个在字符串尾部,依次对指针指向的字符进行交换,然后移动指针
代码:
class Solution {
public void reverseString(char[] s) {
int l = 0;
int r = s.length - 1;
for (int i = 0; i < s.length / 2; i++) {
char temp = ' ';
temp = s[l];
s[l] = s[r];
s[r] = temp;
l++;
r--;
}
}
}
反转字符串II
题目链接:
视频链接:
字符串操作进阶! | LeetCode:541. 反转字符串II (opens new window)
思路:
朴树解法:
对字符串进行遍历,按照提议进行模拟翻转操作(较为麻烦)
代码:
class Solution {
public String reverseStr(String s, int k) {
int len=s.length();
char[] chars = s.toCharArray();
int count=0;
int start=0;
int l=0,r=0;
while (len>=2*k){
count+=2*k;
start=count-2*k;
l=start;
r=start+k-1;
for (int i = 0; i <k/2 ; i++) {
char temp=' ';
temp=chars[l];
chars[l]=chars[r];
chars[r]=temp;
l++;
r--;
}
len-=2*k;
}
if(len<k){
int st=chars.length-len;
int en=chars.length-1;
for (int i = 0; i <len/2 ; i++) {
char temp=' ';
temp=chars[st];
chars[st]=chars[en];
chars[en]=temp;
st++;
en--;
}
} else if (len<2*k) {
int st=chars.length-len;
int en=st+k-1;
for (int i = 0; i <k/2 ; i++) {
char temp=' ';
temp=chars[st];
chars[st]=chars[en];
chars[en]=temp;
st++;
en--;
}
}
String ans="";
for (int i = 0; i <chars.length ; i++) {
ans+=chars[i]+"";
}
return ans;
}
}
思路2:其实在遍历字符串的过程中,只要让 i += (2 * k),i 每次移动 2 * k 就可以了,然后判断是否需要有反转的区间。
代码:
class Solution {
public String reverseStr(String s, int k) {
char[] ch = s.toCharArray();
for(int i = 0; i < ch.length; i += 2 * k){
int start = i;
//这里是判断尾数够不够k个来取决end指针的位置
int end = Math.min(ch.length - 1, start + k - 1);
//用异或运算反转
while(start < end){
ch[start] ^= ch[end];
ch[end] ^= ch[start];
ch[start] ^= ch[end];
start++;
end--;
}
}
return new String(ch);
}
}
替换数字
题目链接:
思路:
常规遍历,假如碰到数字就进行替换
代码:
package Java_algorithm.String;
import java.util.Scanner;
public class kmw_54 {
public static String Replacenumbers(String str){
String ans="";
char[] charArray = str.toCharArray();
for (int i = 0; i < charArray.length ; i++) {
if(charArray[i]>='a'&&charArray[i]<='z'){
ans+=charArray[i];
}else {
ans+="number";
}
}
return ans;
}
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
String str= sc.next();
System.out.println(Replacenumbers(str));
}
}
翻转字符串中的单词
题目链接:
视频链接:
字符串复杂操作拿捏了! | LeetCode:151.翻转字符串里的单词 (opens new window)
利用split()对字符串中的空格进行处理,然后利用list对单词进行保存,后对list进行反转
代码:
class Solution {
public String reverseWords(String s) {
LinkedList<String> strings = new LinkedList<>();
String[] split = s.split(" ");
for (int i = 0; i <split.length ; i++) {
if(split[i]!=""){
strings.add(split[i]);
}
}
Collections.reverse(strings);
String ans="";
for (int i = 0; i <strings.size() ; i++) {
if(i==strings.size()-1){
ans+=strings.get(i);
}else {
ans+=strings.get(i)+" ";
}
}
return ans;
}
}
右旋转字符串
题目链接:
题目较简单,利用substring直接截取即可
代码:
import java.util.Scanner;
public class Main {
public static String RightHandedString(String str,int k){
String ans="";
ans+=str.substring(str.length()-k);
ans+=str.substring(0,str.length()-k);
return ans;
}
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int k=scanner.nextInt();
String str=scanner.next();
System.out.println(RightHandedString(str,k));
}
}
不用库函数
思路:
利用双指针进行反转,先将整个字符串进行反转,后面分别将前k个字符反转,和后面的字符进行反转
代码:
import java.util.Scanner;
public class kmw_55_01 {
public static String reverse(String str,int st,int ed){
char[] charArray = str.toCharArray();
while (st<ed){
char temp=' ';
temp=charArray[st];
charArray[st]=charArray[ed];
charArray[ed]=temp;
st++;
ed--;
}
return new String(charArray);
}
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int k= scanner.nextInt();
String str= scanner.next();
String reverse = reverse(str, 0, str.length() - 1);
reverse=reverse(reverse,0,k-1);
reverse=reverse(reverse,k,str.length()-1);
System.out.println(reverse);
}
}