首页 > 其他分享 >【LeeCode】344. 反转字符串

【LeeCode】344. 反转字符串

时间:2023-02-18 23:32:49浏览次数:50  
标签:char right Solution 344 LeeCode 字符串 new public left

【题目描述】

编写一个函数,其作用是将输入的字符串反转过来。输入字符串以字符数组 ​​s​​ 的形式给出。

不要给另外的数组分配额外的空间,你必须​​原地​​修改输入数组、使用 O(1) 的额外空间解决这一问题。

​https://leetcode.cn/problems/reverse-string/description/​


【示例】

【LeeCode】344. 反转字符串_数组

【代码】​​双指针​

package com.company;
import java.util.*;

// 2022-02-18
class Solution {
public void reverseString(char[] s) {
int len = s.length;
for(int left = 0, right = len - 1; left < right; ++left, --right){
char tmp = s[left];
s[left] = s[right];
s[right] = tmp;
}
System.out.println(Arrays.toString(s));
System.out.println(Arrays.toString(s));
}
}

public class Test {
public static void main(String[] args) {
new Solution().reverseString(new char[]{'h', 'e', 'l', 'l', '0'}); // 输出:["o","l","l","e","h"]
new Solution().reverseString(new char[]{'2', '0', '2', '3'}); // 输出:['3', '2', '0', '2']
}
}


package com.company;
import java.util.*;

// 2022-02-18
class Solution {
public void reverseString(char[] s) {
int left = 0;
int right = s.length - 1;
while (left < right){
char tmp = s[left];
s[left] = s[right];
s[right] = tmp;
left++;
right--;
}

System.out.println(Arrays.toString(s));
System.out.println(Arrays.toString(s));
}
}

public class Test {
public static void main(String[] args) {
new Solution().reverseString(new char[]{'h', 'e', 'l', 'l', '0'}); // 输出:["o","l","l","e","h"]
new Solution().reverseString(new char[]{'2', '0', '2', '3'}); // 输出:['3', '2', '0', '2']
}
}


标签:char,right,Solution,344,LeeCode,字符串,new,public,left
From: https://blog.51cto.com/u_13682316/6065714

相关文章