forked from AnasImloul/Leetcode-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathReverse String II.java
36 lines (36 loc) · 924 Bytes
/
Reverse String II.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
class Solution {
public String reverseStr(String s, int k) {
char[] ch=s.toCharArray();
int cnt=1,i=0;
StringBuilder sb=new StringBuilder();
String ans="";
if(k>=s.length()){
sb.append(s);
sb.reverse();
return sb.toString();
}
for(i=0;i<s.length()-k;i+=k){
String str=s.substring(i,i+k);
if(cnt%2!=0){
sb.append(str);
sb.reverse();
ans+=sb.toString();
cnt++;
sb=new StringBuilder();
}
else{
ans+=str;
cnt++;
}
}
if(cnt%2!=0){
sb.append(s.substring(i,s.length()));
sb.reverse();
ans+=sb.toString();
}
else{
ans+=s.substring(i,s.length());
}
return ans;
}
}