일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- arraylist
- boj
- 정렬
- Stack
- 알고리즘
- 배열
- hashmpa
- array
- 백준
- 자바 메모리 영역
- Garbage Collecter
- 해시맵
- 단계별로
- 백준알고리즘
- 자바
- 어레이리스트
- 별찍기
- 1152
- 차이
- java
- 백준 알고리즘
- 링크드해시맵
- list
- class area
- 또뭐테그해야하냐
- 데큐
- 풀어보기
- 메모리영역
- 단어의개수
- 해시테이블
- Today
- Total
장벚꽃박튤립
Code 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980 import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.StringTokenizer; public class BOJ6064 { public static void main(String[] args) throws IOException{ BufferedReader br = new BufferedRea..
Code 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354 import java.util.Scanner; public class BOJ1475 { public static void main(String[] args) { Scanner scan = new Scanner(System.in); int N = scan.nextInt(); int temp, max = 0, six = 0, nine = 0; int res = 0; scan.close(); if(N == 0) { System.out.println(1); return; } int[] array = new int[10]; //..
Code 1234567891011121314151617181920212223242526272829303132333435363738394041 import java.util.Scanner; public class BOJ2775 { public static void main(String[] args) { Scanner scan = new Scanner(System.in); int T = scan.nextInt(); int k,n; int sum; int[][] array = new int[15][14]; int[] res = new int[T]; for(int i = 0; i
Code 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253import java.util.Scanner; public class BOJ10250 { public static void main(String[] args) { Scanner scan = new Scanner(System.in); int T = scan.nextInt(); int H, W, N; int YY, xx; double temp = 0; ; String XX; String[] res = new String[T]; for (int i = 0; i
Code 1234567891011121314151617181920212223242526272829import java.util.Scanner; public class BOJ2941 { public static void main(String[] args) { Scanner scan = new Scanner(System.in); int cnt; String str = " " + scan.nextLine() + " "; scan.close(); cnt = str.length()-2; for (int i = 1; i
Code 123456789101112131415161718192021222324import java.util.Scanner; // 108ms public class BOJ2292 { public static void main(String[] args) { Scanner scan = new Scanner(System.in); int N = scan.nextInt(); int a = 1; int answer = 0; scan.close(); for (int i = 1; i
Code123456789101112131415 import java.util.Scanner; public class BOJ1152 { public static void main(String[] args) { Scanner scan = new Scanner(System.in); String str = scan.nextLine(); scan.close(); str = str.trim(); String[] str1 = str.split(" "); System.out.println((str.isEmpty())? 0 : str1.length); }} Colored by Color Scriptercs Algorithm * 들어온 string에 trim을 걸어준다. (공백으로 스플릿할 것이기 때문)* 공백 기준으로 ..
Code import java.util.Scanner;public class BOJ1157 {public static void main(String[] args) {Scanner scan = new Scanner(System.in);int[] alpha = new int[] { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };int ch, max = 0, cnt = 0;char c = '.';String str = scan.nextLine();for (int i = 0; i = 97) { // 소문자면ch = ch - 97;} else { // 대문자면ch -= 65;}alpha[ch]++;}for (int a ..