leetcode ReverseString
z
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
public class ReverseString {
/**
* 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"]
*/
public static void reverseString(char[] s) {
int n = s.length;
int left = 0;
int right = s.length-1;
while(left < right){
char t = s[left];
s[left] = s[right];
s[right] = t;
left ++;
right --;
}
return ;
}
public static void main(String[] args){
char[] s = new char[]{'h','e','l','l','0'};
reverseString(s);
for (char c: s){
System.out.println(c);
}
}
}