목록자바 (20)

요깨비's LAB

[백준, 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
[백준, BFS, Java] P.2638 치즈

import java.io.IOException; import java.util.LinkedList; import java.util.Queue; import java.util.Scanner; public class Main { static int row; static int col; public static void main(String[] args) throws IOException { Scanner scr = new Scanner(System.in); int cheeseCnt = 0; row = scr.nextInt(); col = scr.nextInt(); int[][] map = new int[row][col]; for (int i = 0; i < row; i++) { for (int j = 0;..
알고리즘(Java)/BFS&DFS 2021. 8. 31. 23:11
[프로그래머스, JAVA] 행렬 테두리 회전하기

class Solution { public int[] solution(int rows, int columns, int[][] queries) { int[] answer = {}; Matrix matrix = new Matrix(rows, columns); int queryCount = queries.length; answer = new int[queryCount]; for(int i=0;i col1; i--) { matrix[row2][i-1] = copyMatrix[row2][i]; if(min > copyMatrix[row2][i]) { min = copyMatrix[row2][i]; } } for (int i = row2; i > row1; i--) { matrix[i-1][col1] = copyM..
알고리즘(Java)/프로그래머스 2021. 6. 15. 19:01
[프로그래머스, JAVA] 뉴스 클러스터링

import java.util.* class Solution { public int solution(String str1, String str2) { int answer = 0; str1 = str1.toUpperCase(); str2 = str2.toUpperCase(); Map str1Map = new HashMap(); Map str2Map = new HashMap(); setMap(str1Map, str1); setMap(str2Map, str2); double intersaction = getIntersection(str1Map, str2Map); double union = getUnion(str1Map, str2Map); double value = 1; if((int)union == 0 && ..
알고리즘(Java)/프로그래머스 2021. 6. 14. 23:35
[프로그래머스, JAVA] 단체사진 찍기

import java.util.HashMap; import java.util.Map; class Solution { static boolean[] isVisited = new boolean[8]; static String[] characters = {"A", "C", "F", "J", "M", "N", "R", "T"}; static int result = 0; public int solution(int n, String[] data) { int answer = 0; result = 0; for (int i = 0; i < 8; i++) { Map map = new HashMap(); isVisited[i] = true; int index = 0; map.put(characters[i], index); ..
알고리즘(Java)/프로그래머스 2021. 6. 5. 16:47
[백준, 그래프 이론, Java] P.2188 축사 배정(이분 매칭)

import java.util.ArrayList; import java.util.List; import java.util.Scanner; class Cow { int id; List preferences; public Cow(int id) { this.id = id; this.preferences = new ArrayList(); } } public class Main { public static int[] barns; public static boolean[] isProccesed; public static List cows; public static int N; public static int M; public static void main(String[] args) { Scanner scr = ne..
알고리즘(Java)/그래프 이론 2021. 4. 20. 12:56
[백준, 그래프 이론, Java] P.1197 최소 스패닝 트리 (프림)

import java.util.ArrayList; import java.util.List; import java.util.PriorityQueue; import java.util.Scanner; class Vertax { int id; boolean isVisited; List edges; public Vertax(int id) { this.id = id; this.isVisited = false; this.edges = new ArrayList(); } } class Edge { int from; int to; int value; public Edge(int from, int to, int value) { this.from = from; this.to = to; this.value = value; } ..
알고리즘(Java)/그래프 이론 2021. 4. 16. 19:23
Prev 1 2 3 Next