友情支持
如果您觉得这个笔记对您有所帮助，看在D瓜哥码这么多字的辛苦上，请友情支持一下，D瓜哥感激不尽，😜
|
|
有些打赏的朋友希望可以加个好友，欢迎关注D 瓜哥的微信公众号，这样就可以通过公众号的回复直接给我发信息。
公众号的微信号是: jikerizhi。因为众所周知的原因，有时图片加载不出来。 如果图片加载不出来可以直接通过搜索微信号来查找我的公众号。 |
344. Reverse String
这个跟 Valid Palindrome - LeetCode 的思路类似，都是"左右夹击"。
Write a function that reverses a string. The input string is given as an array of characters char[].
Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
You may assume all the characters consist of printable ascii characters.
Example 1:
Input: ["h","e","l","l","o"]
Output: ["o","l","l","e","h"]Example 2:
Input: ["H","a","n","n","a","h"]
Output: ["h","a","n","n","a","H"] 1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
/**
* Runtime: 1 ms, faster than 100.00% of Java online submissions for Reverse String.
*
* Memory Usage: 52.7 MB, less than 5.33% of Java online submissions for Reverse String.
*/
public void reverseString(char[] s) {
if (Objects.isNull(s) || s.length == 0) {
return;
}
for (int left = 0, right = s.length - 1; left < right; left++, right--) {
char temp = s[left];
s[left] = s[right];
s[right] = temp;
}
}