알고리즘 풀이/백준

[백준][Java] 1254번 팰린드롬 만들기 (문자열, 완전탐색)

배게 2021. 9. 23. 07:07
728x90

참고 : https://yoon1fe.tistory.com/206

 

혼자서 못풀음..ㅜㅜ

끝에서부터 input.substring(0,i)를 붙여준 값 StringBuilder.reverse()를 해준다는 개념..

 

시간 단축 더 하려면 stringbuilder클래스의 reverse()함수 안쓰고

배열로 처리하면 됨 근데 배열로 하면 헷갈림

 

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
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
 
 
public class Main {
        
    private static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    private static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
    
    
    public static void main(String[] args) throws IOException{
        String input = br.readLine();
        
        if(input.equals(new StringBuilder(input).reverse().toString())) {
            System.out.println(input.length());
            return
        }
        
        for(int i=1; i<input.length(); i++) {
            StringBuilder sBuilder = new StringBuilder(input);
            sBuilder.append(new StringBuilder(input.substring(0,i)).reverse() );
            if(sBuilder.toString().equals(sBuilder.reverse().toString())) {
                System.out.println(sBuilder.length());
                return
            }
        }
        
        
//        bw.write("");
//        bw.flush();
//        bw.close();
        
            
        
    }
    
//    private static int stoi(String input) {
//        return Integer.parseInt(input);
//    }
    
}
 
cs
댓글수0