kingsubin kingsubin

import java.io.*; import java.util.LinkedList; import java.util.Queue; import java.util.StringTokenizer; public class boj_1158 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringBuilder sb = new StringBuilder(); StringTokenizer st = new StringTokenizer(br.readLine()); int n = Integer.parseInt(st.nextToken(..

import java.io.*; import java.util.Stack; public class boj_1406 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); Stack left = new Stack(); Stack right = new Stack(); String first = br.readLine(); int m = Integer.parseInt(br.readLine())..

import java.io.*; import java.util.Stack; public class boj_1874 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringBuilder sb = new StringBuilder(); Stack s = new Stack(); int n = Integer.parseInt(br.readLine()); // 1 ~ 100,000 int item = 0; // 스택에 오름차순으로 쌓일 수 while (n-- > 0) { int x = Integer.parseInt(br...

import java.io.*; public class boj_9012 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); int T = Integer.parseInt(br.readLine()); for (int i = 0; i < T; i++) { String str = br.readLine(); int temp = 0; for (int j = 0; j < str.length();..

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Stack; public class boj_9093 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringBuffer sb = new StringBuffer(); int T = Integer.parseInt(br.readLine()); for (int i = 0; i < T; i++) { String str = b..

import java.io.*; public class boj_10828 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N = Integer.parseInt(br.readLine()); stack s = new stack(N); for (int i = 0; i < N; i++) { String str = br.readLine(); switch (str) { case "push" : s.push(Integer.parseInt(str.split(" ")[1])); case "pop" : s.pop(); ca..

class Solution { public long[] solution(int x, int n) { long[] answer = new long[n]; long temp = x; int index = 0; while (index != n) { answer[index] = temp; index++; temp += x; } return answer; } } - 성공 - for문보다 while 문 생각이 먼저나서 while문으로 풀었음 class Solution { public long[] solution(long x, int n) { long[] answer = new long[n]; for(int i = 0; i < n; i++){ answer[i] = x * (i + 1); } return answer;..

class Solution { public boolean solution(int x) { int sum = 0; char[] chars = String.valueOf(x).toCharArray(); for (char c : chars) { sum += c - '0'; } return x % sum == 0; } } - 성공 - char 타입으로 바꿔서 풀이 class Solution { public boolean solution(int x) { int mod = x; int sum = 0; do { sum += (mod % 10); mod /= 10; } while(mod % 10 > 0); return x % sum == 0; } } - 다른 사람 풀이 - 숫자 자체로 각 자릿수를 뽑아서 합을 구함