[백준][Java] 11656번 접미사 배열 (문자열)

시간 단축

1. System.out.println 반복문 -> StringBuilder append함수

2. List -> Array

 

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Arrays;
 
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();
        
        
        String[] arr = new String[input.length()];
        for(int i=0; i<input.length(); i++) {
            
            arr[i] = input.substring(i);
        }
        
        Arrays.sort(arr);
        
        StringBuilder sBuilder = new StringBuilder();
        for (String suffix : arr) {
            sBuilder.append(suffix+"\n");
        }
        System.out.println(sBuilder.toString());
        
        
        
//        bw.write("");
//        bw.flush();
//        bw.close();
 
    }
 
 
    
//    private static int stoi(String input) {
//        return Integer.parseInt(input);
//    }
    
}