-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
541.java
49 lines (46 loc) · 1.51 KB
/
541.java
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
46
47
48
49
__________________________________________________________________________________________________
sample 0 ms submission
class Solution {
public String reverseStr(String s, int k) {
char[] res = s.toCharArray();
for(int i = 0; i < s.length(); i+=2*k){
swap(res,i,Math.min(i+k-1,s.length()-1));
}
return new String(res);
}
private void swap(char[] res, int start, int end){
while(start < end){
char tmp = res[start];
res[start++]= res[end];
res[end--]= tmp;
}
}
}
__________________________________________________________________________________________________
sample 37388 kb submission
class Solution {
public String reverseStr(String s, int k) {
char[] chs = s.toCharArray();
int len = chs.length;
boolean reverseFlag = true;
for(int i = 0; i < len; i += k){
if(reverseFlag){
int left = i;
int right = Math.min(left + k - 1, len - 1);
reversePartOfCharArray(chs, i, right);
}
reverseFlag = !reverseFlag;
}
return String.valueOf(chs);
}
public void reversePartOfCharArray(char[] chs, int l, int r){
while(l < r){
char tmp = chs[l];
chs[l] = chs[r];
chs[r] = tmp;
l ++;
r --;
}
}
}
__________________________________________________________________________________________________