본문 바로가기

알고리즘 & 자료구조/프로그래머스132

내적 package programmers; public class DotProduct { public int solution(int[] a, int[] b) { int answer = 0; for (int i = 0; i < a.length; i++) { answer += (a[i] * b[i]); } return answer; } } 2022. 4. 16.
음양 더하기 package programmers; public class AddNegativeAndPositiveNumbers { public int solution(int[] absolutes, boolean[] signs) { int answer = 0; for (int i = 0; i < absolutes.length; i++) { if(signs[i]){ answer += absolutes[i]; }else{ answer += -1 * absolutes[i]; } } return answer; } } 2022. 4. 15.
없는 숫자 더하기 package programmers; public class AddMissingNumbers { public static int solution(int[] numbers) { boolean[] isCheck = new boolean[10]; for (int i: numbers) { isCheck[i] = true; } int answer = 0; for (int i = 0; i < isCheck.length; i++) { if (!isCheck[i]) { answer += i; } } return answer == 0 ? -1 : answer; } } 2022. 4. 14.
단체 사진 찍기 package programmers; public class TakeAGroupPhoto { public static int answer = 0; public static String[] friends = {"A", "C", "F", "J", "M", "N", "R", "T"}; public static int solution(int n, String[] data) { boolean[] isVisited = new boolean[8]; dfs("", isVisited, data); return answer; } private static void dfs(String names, boolean[] isVisited, String[] data) { if (names.length() == 7) { if (ch.. 2022. 4. 13.
카카오 프렌즈 컬러링북 package programmers; import java.util.LinkedList; import java.util.Queue; public class KakaoFriendsColoringBook { public static int[] dy = {-1, 0, 1, 0}; public static int[] dx = {0, 1, 0, -1}; public static int[] solution(int m, int n, int[][] picture) { int[][] tmp = new int[m][n]; for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { tmp[i][j] = picture[i][j]; } } int[] answer = new int.. 2022. 4. 2.
크레인 인형뽑기 게임 import java.util.Stack; class Solution { public static int solution(int[][] board, int[] moves) { Stack basket = new Stack(); int answer = 0; for (int i = 0; i < moves.length; i++) { int movePosition = moves[i] - 1; for (int j = 0; j < board.length; j++) { if (board[j][movePosition] != 0) { int dollNumber = board[j][movePosition]; answer += pushBasket(basket, dollNumber); board[j][movePosition] .. 2022. 3. 30.

티스토리툴바