목록알고리즘(Java) (45)

요깨비's LAB

[hacker-rank, 문자열, Java] Strong Password

https://www.hackerrank.com/challenges/strong-password/problem?h_r=next-challenge&h_v=zen https://www.hackerrank.com/challenges/strong-password/problem?h_r=next-challenge&h_v=zen www.hackerrank.com import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.function.*; import java.util.regex.*; import java.u..
알고리즘(Java)/문자열처리 2021. 10. 5. 20:36
[백준, Brute-Force, Java] P.7795 먹을 것인가 먹힐 것인가

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Arrays; import java.util.StringTokenizer; public class Main { static int T; static int[] A; static int[] B; public static void main(String[] args) { YoggaebReader input = new YoggaebReader(); T = input.nextInt(); StringBuilder sb = new StringBuilder(); for(int t=0;t
알고리즘(Java)/Brute-Force 2021. 10. 2. 17:23
[백준, Brute-Force, Java] P.9663 n-queen

간만에 맞았던문제를 다시 풀어보았다. import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.List; import java.util.StringTokenizer; public class Main { static int N; static int result = 0; static List queenTiles = new ArrayList(); public static void main(String[] args) { YoggaebReader input = new YoggaebReader(); N = input.nextIn..
알고리즘(Java)/Brute-Force 2021. 9. 30. 16:40
[백준, Brute-Force, Java] P.1182 부분수열의 합

import java.io.*; import java.util.StringTokenizer; public class Main { static int N, S; static int count = 0; static int[] arr; public static void main(String[] args) { YoggaebReader scr = new YoggaebReader(); N = scr.nextInt(); S = scr.nextInt(); arr = new int[N]; for (int i = 0; i < N; i++) { arr[i] = scr.nextInt(); } for (int i = 0; i < N; i++) { doAlgorithm(i, arr[i]); } System.out.print(co..
알고리즘(Java)/Brute-Force 2021. 9. 30. 14:17
[프로그래머스, Java] 자물쇠와 열쇠

class Solution { static int len; static int keyLen; static int lockLen; static int[][] map; public boolean solution(int[][] key, int[][] lock) { boolean answer = true; keyLen = key.length; lockLen = lock.length; len = lockLen + (2 * (lockLen - 1)); // len = keyLen + (2 * (keyLen - 1)); => 착오 map = new int[len][len]; int lockZeroCnt = 0; for (int i = 0; i < lockLen; i++) { for (int j = 0; j < loc..
알고리즘(Java)/프로그래머스 2021. 9. 23. 18:39
[백준, Tree, Java] P.1991 트리 순회

import java.util.HashMap; import java.util.Map; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scr = new Scanner(System.in); int N = scr.nextInt(); Map nodes = new HashMap(); for (int i = 0; i < N; i++) { String id = String.valueOf((char) ('A' + i)); nodes.putIfAbsent(id, new Node(id)); } for (int i = 0; i < N; i++) { String rootId = scr.next(); St..
알고리즘(Java)/그래프 이론 2021. 9. 23. 18:01
[백준, BFS, Java] P.2146 다리 만들기

import java.util.*; public class Main { static int N; static int groupCount = 0; static int[][] map; static boolean[][] isVisited; static int min = Integer.MAX_VALUE; public static void main(String[] args) { Scanner scr = new Scanner(System.in); N = scr.nextInt(); map = new int[N][N]; isVisited = new boolean[N][N]; for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { map[i][j] = scr.nextI..
알고리즘(Java)/BFS&DFS 2021. 9. 20. 17:29
[프로그래머스, Java] 거리두기 확인하기

import java.util.*; class Solution { public int[] solution(String[][] places) { int[] answer = new int[5]; int caseLen = places.length; for (int i = 0; i < 5; i++) { char[][] map = new char[5][5]; List participants = new ArrayList(); for (int j = 0; j < 5; j++) { char[] carr = places[i][j].toCharArray(); for (int k = 0; k < 5; k++) { if (carr[k] == 'P') { participants.add(new Participant(j, k));..
알고리즘(Java)/프로그래머스 2021. 9. 9. 19:16
Prev 1 2 3 4 5 6 Next