-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathReverseString.java
More file actions
45 lines (43 loc) · 1.07 KB
/
ReverseString.java
File metadata and controls
45 lines (43 loc) · 1.07 KB
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
41
42
43
44
45
package main.java.algorithm;
/**
* 344. Reverse String
*
* Write a function that reverses a string. The input string is given as an array of characters s.
* You must do this by modifying the input array in-place with O(1) extra memory.
* <p>
* Example 1:
* Input: s = ["h","e","l","l","o"]
* Output: ["o","l","l","e","h"]
* Example 2:
* <p>
* Input: s = ["H","a","n","n","a","h"]
* Output: ["h","a","n","n","a","H"]
* <p>
* Constraints:
* 1 <= s.length <= 105
* s[i] is a printable ascii character.
*/
public class ReverseString
{
public static void main(String[] args)
{
char[] string = {'a', 'b', 'c', 'd', 'e'};
reverseString(string);
for(char num : string) {
System.out.print(num);
}
}
private static void reverseString(char[] string)
{
int start = 0;
int end = string.length - 1;
char aux;
while(start < end) {
aux = string[start];
string[start] = string[end];
string[end] = aux;
start++;
end--;
}
}
}