취업준비 - 코테 , 면접/알고리즘(코테) 공부
알고리즘 입문(Java) - String - 4.단어뒤집기
kwohyuno
2023. 2. 6. 19:30
풀이1.
import java.util.*;
class Main {
public ArrayList<String> solution(int n, String[] str){
ArrayList<String> answer=new ArrayList<>();
for(String x : str){
String tmp=new StringBuilder(x).reverse().toString();
answer.add(tmp);
}
return answer;
}
public static void main(String[] args){
Main T = new Main();
Scanner kb = new Scanner(System.in);
int n=kb.nextInt();
String[] str=new String[n];
for(int i=0; i<n; i++){
str[i]=kb.next();
}
for(String x : T.solution(n, str)){
System.out.println(x);
}
}
}
풀이2.
import java.util.*;
class Main {
public ArrayList<String> solution(int n, String[] str){
ArrayList<String> answer=new ArrayList<>();
for(String x : str){
char[] s=x.toCharArray();
int lt=0, rt=x.length()-1;
while(lt<rt){
char tmp=s[lt];
s[lt]=s[rt];
s[rt]=tmp;
lt++;
rt--;
}
String tmp=String.valueOf(s);
answer.add(tmp);
}
return answer;
}
public static void main(String[] args){
Main T = new Main();
Scanner kb = new Scanner(System.in);
int n=kb.nextInt();
String[] str=new String[n];
for(int i=0; i<n; i++){
str[i]=kb.next();
}
for(String x : T.solution(n, str)){
System.out.println(x);
}
}
}