백준~문풀 후 최적화 추가~/단계별로 풀어보기
11022 A+B - 8
elesis
2021. 9. 13. 10:02
* BufferedReader, BufferedWriter, StringTokenizer
import java.io.*;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
int num = Integer.parseInt(br.readLine());
for(int i=1; i<=num; i++) {
StringTokenizer token = new StringTokenizer(br.readLine());
int a = Integer.parseInt(token.nextToken());
int b = Integer.parseInt(token.nextToken());
int c = a + b;
bw.append("Case #");
bw.append(i+": ");
bw.append(a+" + "+b);
bw.append(" = "+c);
bw.append("\n");
}
br.close();
bw.flush();
bw.close();
}
}
* BufferedReader, StringBuilder, StringTokenizer, STATIC FINAL 상수
import java.io.*;
import java.util.StringTokenizer;
public class Main {
public static final String NEW_LINE = "\n";
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringBuilder sb = new StringBuilder();
int times = Integer.parseInt(br.readLine());
for (int i = 0; i < times; i++) {
StringTokenizer st = new StringTokenizer(br.readLine());
int a = Integer.parseInt(st.nextToken());
int b = Integer.parseInt(st.nextToken());
int sum = a + b;
sb.append("Case #").append(i + 1).append(": ").append(a + " + " + b + " = " + sum).append(NEW_LINE);
}
System.out.println(sb.toString());
}
}
메모리, 속도 부분에서 BufferedWriter보다 StringBuilder가 우수