전체 글 (17) 썸네일형 리스트형 BAEKJOON(백준) Queue - 18258번 JAVA / PYTHON CODE 자바 시간초과오류 import java.util.*; import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.ArrayList; import java.awt.List; import java.io.IOException; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); //큐를 나타낼 arraylist ArrayList queue = new ArrayList();\ //결과값을 나타낼 array.. BAEKJOON(백준) Stack - 1874번 JAVA CODE 실패한 코드 import java.io.*; import java.util.Stack; import java.util.Scanner; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); Scanner in = new Scanner(System.in); Stack s = new Stack(); Stack number = new Stack(); int T = in.nextInt(); int[] arr = new int[T]; char[] ans = new char[100]; boolean.. BAEKJOON(백준) Stack - 10773번 PYTHON / JAVA CODE Python Code import sys #testcase 입력 k = sys.stdin.readline() k = int(k) #스택 stack = [] #0이면 pop하고, 아니면 append for i in range(k): n = sys.stdin.readline() n = int(n) if n == 0: stack.pop() else: stack.append(n) sum = 0 #스택 안에 남아있는 숫자들 전부 합하기 for i in range(len(stack)): sum += int(stack.pop()) print(sum) JAVA Code package BaekJoon; import java.io.BufferedReader; import java.io.InputStreamReader; i.. BAEKJOON(백준) Stack - 4949번 PYTHON / JAVA CODE Python 틀린 코드 import sys while True: sentence = sys.stdin.readline().rstrip() if sentence == ".": break answer = True stack = [] for s in sentence: if s == "(" or s == "[": stack.append(s) elif s == ")": if len(stack) == 0: answer = False break elif stack[-1] == "(": stack.pop() else: answer = False break elif s == "]": if len(stack) == 0: answer = False break elif stack[-1] == "[": stack.pop() e.. BAEKJOON(백준) Stack - 10828번 PYTHON / JAVA CODE python import sys n = int(sys.stdin.readline()) stack = [] #스택 res = [] #결과 담을 list #empty 확인 함수 def empty(lst): if len(lst) == 0: return True for i in range(n): command = sys.stdin.readline().split() #push일 때 if command[0] == 'push': stack.append(command[1]) #pop일 때 elif command[0] == 'pop': if empty(stack): res.append(-1) else: res.append(stack.pop()) #size일 때 elif command[0] == 'size': res.ap.. BAEKJOON(백준) 문자열 - 1316번 JAVA CODE 정답 package BaekJoon; import java.io.BufferedReader; import java.io.InputStreamReader; import java.io.IOException; import java.util.*; import java.io.*; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); char[] sp; int N = Integer.parseInt(br.readLine()); String str; int last_idx = -1; int rear_.. BAEKJOON(백준) 문자열 - 1152번 JAVA CODE import java.util.Scanner; public class Main { public static void main(String[] args){ Scanner s = new Scanner(System.in); String str = new String(); String[] word; //단어의 수를 count해줄 정수형 변수 int count = 0; //문자열 입력받기 str = s.nextLine(); //띄어쓰기 기준으로 문자열 해체 word = str.split(" "); //해체했을 때 띄어쓰기가 여러개 포함되어있으면, 단어의 수로 카운트 될 수가 있음 for(int i=0; i BAEKJOON(백준) 문자열 - 1157번 JAVA CODE package BaekJoon; import java.io.BufferedReader; import java.io.InputStreamReader; import java.io.IOException; public class Main { public static void main(String[] args) throws IOException { //BufferedReader 선언 BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); Boolean bt = false; //문자열 입력 받기 String str = br.readLine(); char[] charac = null; //문자열 길이 추출 int len = str.lengt.. 이전 1 2 3 다음
